<!DOCTYPE html PUBLIC "-//W3C//DTD XHTML 1.0 Transitional//EN" "http://www.w3.org/TR/xhtml1/DTD/xhtml1-transitional.dtd">
<html xmlns="http://www.w3.org/1999/xhtml">
<head>
<meta http-equiv="Content-Type" content="text/xhtml;charset=UTF-8"/>
<meta http-equiv="X-UA-Compatible" content="IE=9"/>
<title>Disjoint Stable Set Problems - Formulations by Representatives and Combinatorial Solvers: datastruct/ArrayvEBTree.h Source File</title>
<link href="tabs.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="jquery.js"></script>
<script type="text/javascript" src="dynsections.js"></script>
<link href="search/search.css" rel="stylesheet" type="text/css"/>
<script type="text/javascript" src="search/search.js"></script>
<script type="text/javascript">
  $(document).ready(function() { searchBox.OnSelectItem(0); });
</script>
<link href="doxygen.css" rel="stylesheet" type="text/css" />
</head>
<body>
<div id="top"><!-- do not remove this div, it is closed by doxygen! -->
<div id="titlearea">
<table cellspacing="0" cellpadding="0">
 <tbody>
 <tr style="height: 56px;">
  <td style="padding-left: 0.5em;">
   <div id="projectname">Disjoint Stable Set Problems - Formulations by Representatives and Combinatorial Solvers
   </div>
  </td>
 </tr>
 </tbody>
</table>
</div>
<!-- end header part -->
<!-- Generated by Doxygen 1.8.1.1 -->
<script type="text/javascript">
var searchBox = new SearchBox("searchBox", "search",false,'Search');
</script>
  <div id="navrow1" class="tabs">
    <ul class="tablist">
      <li><a href="index.html"><span>Main&#160;Page</span></a></li>
      <li><a href="annotated.html"><span>Classes</span></a></li>
      <li class="current"><a href="files.html"><span>Files</span></a></li>
      <li>
        <div id="MSearchBox" class="MSearchBoxInactive">
        <span class="left">
          <img id="MSearchSelect" src="search/mag_sel.png"
               onmouseover="return searchBox.OnSearchSelectShow()"
               onmouseout="return searchBox.OnSearchSelectHide()"
               alt=""/>
          <input type="text" id="MSearchField" value="Search" accesskey="S"
               onfocus="searchBox.OnSearchFieldFocus(true)" 
               onblur="searchBox.OnSearchFieldFocus(false)" 
               onkeyup="searchBox.OnSearchFieldChange(event)"/>
          </span><span class="right">
            <a id="MSearchClose" href="javascript:searchBox.CloseResultsWindow()"><img id="MSearchCloseImg" border="0" src="search/close.png" alt=""/></a>
          </span>
        </div>
      </li>
    </ul>
  </div>
  <div id="navrow2" class="tabs2">
    <ul class="tablist">
      <li><a href="files.html"><span>File&#160;List</span></a></li>
      <li><a href="globals.html"><span>File&#160;Members</span></a></li>
    </ul>
  </div>
<!-- window showing the filter options -->
<div id="MSearchSelectWindow"
     onmouseover="return searchBox.OnSearchSelectShow()"
     onmouseout="return searchBox.OnSearchSelectHide()"
     onkeydown="return searchBox.OnSearchSelectKey(event)">
<a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(0)"><span class="SelectionMark">&#160;</span>All</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(1)"><span class="SelectionMark">&#160;</span>Classes</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(2)"><span class="SelectionMark">&#160;</span>Files</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(3)"><span class="SelectionMark">&#160;</span>Functions</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(4)"><span class="SelectionMark">&#160;</span>Variables</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(5)"><span class="SelectionMark">&#160;</span>Typedefs</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(6)"><span class="SelectionMark">&#160;</span>Enumerations</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(7)"><span class="SelectionMark">&#160;</span>Enumerator</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(8)"><span class="SelectionMark">&#160;</span>Friends</a><a class="SelectItem" href="javascript:void(0)" onclick="searchBox.OnSelectItem(9)"><span class="SelectionMark">&#160;</span>Macros</a></div>

<!-- iframe showing the search results (closed by default) -->
<div id="MSearchResultsWindow">
<iframe src="javascript:void(0)" frameborder="0" 
        name="MSearchResults" id="MSearchResults">
</iframe>
</div>

<div id="nav-path" class="navpath">
  <ul>
<li class="navelem"><a class="el" href="dir_f9af7c4329e6f916a6a58dc83cbb7ef1.html">datastruct</a></li>  </ul>
</div>
</div><!-- top -->
<div class="header">
  <div class="headertitle">
<div class="title">ArrayvEBTree.h</div>  </div>
</div><!--header-->
<div class="contents">
<a href="ArrayvEBTree_8h.html">Go to the documentation of this file.</a><div class="fragment"><div class="line"><a name="l00001"></a><span class="lineno">    1</span>&#160;</div>
<div class="line"><a name="l00008"></a><span class="lineno">    8</span>&#160;<span class="preprocessor">#ifndef ARRAYVEBTREE_H_</span></div>
<div class="line"><a name="l00009"></a><span class="lineno">    9</span>&#160;<span class="preprocessor"></span><span class="preprocessor">#define ARRAYVEBTREE_H_</span></div>
<div class="line"><a name="l00010"></a><span class="lineno">   10</span>&#160;<span class="preprocessor"></span></div>
<div class="line"><a name="l00011"></a><span class="lineno">   11</span>&#160;<span class="preprocessor">#include&lt;string.h&gt;</span><span class="comment">//necessary to use memset</span></div>
<div class="line"><a name="l00012"></a><span class="lineno">   12</span>&#160;<span class="preprocessor">#include&lt;cstdio&gt;</span></div>
<div class="line"><a name="l00013"></a><span class="lineno">   13</span>&#160;<span class="preprocessor">#include &lt;stdlib.h&gt;</span></div>
<div class="line"><a name="l00014"></a><span class="lineno">   14</span>&#160;<span class="preprocessor">#include &quot;<a class="code" href="BitTools_8h.html">BitTools.h</a>&quot;</span></div>
<div class="line"><a name="l00015"></a><span class="lineno">   15</span>&#160;<span class="preprocessor">#include&quot;vEBTree.h&quot;</span></div>
<div class="line"><a name="l00016"></a><span class="lineno">   16</span>&#160;</div>
<div class="line"><a name="l00017"></a><span class="lineno">   17</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt; <span class="keyword">class </span><a class="code" href="classArrayvEBTreeFactory.html">ArrayvEBTreeFactory</a>;</div>
<div class="line"><a name="l00018"></a><span class="lineno">   18</span>&#160;</div>
<div class="line"><a name="l00034"></a><span class="lineno">   34</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00035"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html">   35</a></span>&#160;<span class="keyword">class </span><a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree</a> : <span class="keyword">public</span> <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet</a>&lt;T&gt; {</div>
<div class="line"><a name="l00036"></a><span class="lineno">   36</span>&#160;<span class="keyword">private</span>:</div>
<div class="line"><a name="l00037"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525">   37</a></span>&#160;        T* <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l00038"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6">   38</a></span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l00039"></a><span class="lineno">   39</span>&#160;</div>
<div class="line"><a name="l00040"></a><span class="lineno">   40</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">bitLeast</a>(<span class="keywordtype">long</span> idx, <span class="keywordtype">long</span> slide, <span class="keywordtype">long</span> h);</div>
<div class="line"><a name="l00041"></a><span class="lineno">   41</span>&#160;</div>
<div class="line"><a name="l00042"></a><span class="lineno">   42</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00043"></a><span class="lineno">   43</span>&#160;</div>
<div class="line"><a name="l00057"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html">   57</a></span>&#160;        <span class="keyword">class </span><a class="code" href="classArrayvEBTree_1_1Iterator.html" title="A generic iterator on the set of elements.">Iterator</a> : <span class="keyword">public</span> <a class="code" href="classDirectlyAddressedSet.html" title="A static or dynamic set of elements with direct addressing.">DirectlyAddressedSet</a>&lt;long&gt;<a class="code" href="classArrayvEBTree_1_1Iterator.html" title="A generic iterator on the set of elements.">::Iterator</a>{</div>
<div class="line"><a name="l00058"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#adde8d9e53c72bd17d0d7f2cc4c5d0f52">   58</a></span>&#160;                <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree</a>;</div>
<div class="line"><a name="l00059"></a><span class="lineno">   59</span>&#160;</div>
<div class="line"><a name="l00060"></a><span class="lineno">   60</span>&#160;                <span class="keyword">protected</span>:</div>
<div class="line"><a name="l00061"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#a0fb963da5cbed1f6648fb13701570290">   61</a></span>&#160;                        <span class="keywordtype">int</span> <a class="code" href="classArrayvEBTree_1_1Iterator.html#a0fb963da5cbed1f6648fb13701570290" title="a copy of the target instance of vEBTree&lt;T&gt;::height.">ht</a>;</div>
<div class="line"><a name="l00062"></a><span class="lineno">   62</span>&#160;</div>
<div class="line"><a name="l00063"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#a9a8f467005b0c38a472531fa2f433807">   63</a></span>&#160;                        T** <a class="code" href="classArrayvEBTree_1_1Iterator.html#a9a8f467005b0c38a472531fa2f433807" title="a copy to the levels in the tree.">levels</a>;</div>
<div class="line"><a name="l00064"></a><span class="lineno">   64</span>&#160;</div>
<div class="line"><a name="l00065"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#a125c36721f010b692db267c0906918a9">   65</a></span>&#160;                        <span class="keywordtype">long</span>* <a class="code" href="classArrayvEBTree_1_1Iterator.html#a125c36721f010b692db267c0906918a9" title="position inside the word, in each level.">slides</a>;</div>
<div class="line"><a name="l00066"></a><span class="lineno">   66</span>&#160;</div>
<div class="line"><a name="l00067"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#ac4510f918b6a84a1bb6aa8affabc6943">   67</a></span>&#160;                        <span class="keywordtype">long</span>* <a class="code" href="classArrayvEBTree_1_1Iterator.html#ac4510f918b6a84a1bb6aa8affabc6943" title="indexes, in each level of the words enumerated.">idxs</a>;</div>
<div class="line"><a name="l00068"></a><span class="lineno">   68</span>&#160;</div>
<div class="line"><a name="l00069"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#a2a71acb3fd39b88fe2ff3ed030fc939a">   69</a></span>&#160;                        <span class="keywordtype">long</span>* <a class="code" href="classArrayvEBTree_1_1Iterator.html#a2a71acb3fd39b88fe2ff3ed030fc939a">lims</a>;<span class="comment">// !&lt; the size of each level.</span></div>
<div class="line"><a name="l00070"></a><span class="lineno">   70</span>&#160;</div>
<div class="line"><a name="l00071"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#a5bdb72999e0e254acfd4c7e156244a94">   71</a></span>&#160;                        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree_1_1Iterator.html#a5bdb72999e0e254acfd4c7e156244a94">logb</a>;<span class="comment">// !&lt; the log of the word size.</span></div>
<div class="line"><a name="l00072"></a><span class="lineno">   72</span>&#160;</div>
<div class="line"><a name="l00073"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#adfe8b2a949d1ccf7e6dc0d32bf790e45">   73</a></span>&#160;                        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree_1_1Iterator.html#adfe8b2a949d1ccf7e6dc0d32bf790e45" title="the size in bits of a word">word_size</a>;</div>
<div class="line"><a name="l00074"></a><span class="lineno">   74</span>&#160;</div>
<div class="line"><a name="l00075"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#ae8f6d0362b9667e5b30ca6e113ec0703">   75</a></span>&#160;                        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree_1_1Iterator.html#ae8f6d0362b9667e5b30ca6e113ec0703" title="the size of the vEBTree that is being enumerate, its a simple copy of the value t-&gt;size().">size</a>;</div>
<div class="line"><a name="l00076"></a><span class="lineno">   76</span>&#160;</div>
<div class="line"><a name="l00077"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#a8a331e1f4c618a0f03b5c76cd43c87e8">   77</a></span>&#160;                        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree_1_1Iterator.html#a8a331e1f4c618a0f03b5c76cd43c87e8" title="the current element in the enumeration">current</a>;</div>
<div class="line"><a name="l00078"></a><span class="lineno">   78</span>&#160;</div>
<div class="line"><a name="l00087"></a><span class="lineno">   87</span>&#160;                        <a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#acc93f949a845d47f30ee6f6c75334577">Iterator</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a> * t);</div>
<div class="line"><a name="l00088"></a><span class="lineno">   88</span>&#160;</div>
<div class="line"><a name="l00089"></a><span class="lineno">   89</span>&#160;                        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree_1_1Iterator.html#ad39278d88dd0d2f0cad2adfe84b4019c">bitLeast</a>(<span class="keywordtype">long</span> idx, <span class="keywordtype">long</span> slide, <span class="keywordtype">long</span> h);</div>
<div class="line"><a name="l00090"></a><span class="lineno">   90</span>&#160;</div>
<div class="line"><a name="l00091"></a><span class="lineno">   91</span>&#160;                <span class="keyword">public</span>:</div>
<div class="line"><a name="l00095"></a><span class="lineno">   95</span>&#160;                        <span class="keyword">virtual</span> <a class="code" href="classArrayvEBTree_1_1Iterator.html#a680777939650bf1bbe7acb53e4f82ab4" title="The destructor.">~Iterator</a>();</div>
<div class="line"><a name="l00096"></a><span class="lineno">   96</span>&#160;</div>
<div class="line"><a name="l00105"></a><span class="lineno">  105</span>&#160;                        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree_1_1Iterator.html#a17bf7e111b3fdb99bc2736f6ebdb160e" title="Start enumeration.">start</a>();</div>
<div class="line"><a name="l00106"></a><span class="lineno">  106</span>&#160;</div>
<div class="line"><a name="l00107"></a><span class="lineno">  107</span>&#160;</div>
<div class="line"><a name="l00119"></a><span class="lineno">  119</span>&#160;                        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree_1_1Iterator.html#a9a5d39b750892c7451ce46c50ad00172" title="Restart enumeration.">restart</a>();</div>
<div class="line"><a name="l00120"></a><span class="lineno">  120</span>&#160;</div>
<div class="line"><a name="l00133"></a><span class="lineno">  133</span>&#160;                        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree_1_1Iterator.html#aa0d4c6de3f7ee3ab07bde1c1934df660" title="Restart enumeration from a specified element.">restartFrom</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00134"></a><span class="lineno">  134</span>&#160;</div>
<div class="line"><a name="l00147"></a><span class="lineno">  147</span>&#160;                        <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classArrayvEBTree_1_1Iterator.html#a5f87c5e123eca5fa27bf58bb670ee88c" title="Determine if still there is a element in the set not enumerated yet.">hasNext</a>();</div>
<div class="line"><a name="l00148"></a><span class="lineno">  148</span>&#160;</div>
<div class="line"><a name="l00157"></a><span class="lineno">  157</span>&#160;                        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree_1_1Iterator.html#a15293b0382355e96ae1b45022937e535" title="Index of the next element in the set according to the current enumeration.">next</a>();</div>
<div class="line"><a name="l00158"></a><span class="lineno">  158</span>&#160;                };</div>
<div class="line"><a name="l00159"></a><span class="lineno">  159</span>&#160;</div>
<div class="line"><a name="l00174"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html">  174</a></span>&#160;        <span class="keyword">class </span><a class="code" href="classArrayvEBTree_1_1FilterIterator.html">FilterIterator</a> : <span class="keyword">public</span> <a class="code" href="classDirectlyAddressedSet.html" title="A static or dynamic set of elements with direct addressing.">DirectlyAddressedSet</a>&lt;long&gt;<a class="code" href="classArrayvEBTree_1_1Iterator.html" title="A generic iterator on the set of elements.">::Iterator</a>{</div>
<div class="line"><a name="l00175"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#adde8d9e53c72bd17d0d7f2cc4c5d0f52">  175</a></span>&#160;                <span class="keyword">friend</span> <span class="keyword">class </span><a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree</a>;</div>
<div class="line"><a name="l00176"></a><span class="lineno">  176</span>&#160;</div>
<div class="line"><a name="l00177"></a><span class="lineno">  177</span>&#160;                <span class="keyword">protected</span>:</div>
<div class="line"><a name="l00178"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a2544e72c3180595601612c00df601918">  178</a></span>&#160;                        <a class="code" href="classDirectlyAddressedSet.html">DirectlyAddressedSet&lt;long&gt;</a>* <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a2544e72c3180595601612c00df601918" title="the filter to enumeration">filter</a>;</div>
<div class="line"><a name="l00179"></a><span class="lineno">  179</span>&#160;</div>
<div class="line"><a name="l00180"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a3290f66a583843bd013717ecbfc78ea8">  180</a></span>&#160;                        <span class="keywordtype">int</span> <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a3290f66a583843bd013717ecbfc78ea8" title="a copy of the target instance of vEBTree&lt;T&gt;::height.">ht</a>;</div>
<div class="line"><a name="l00181"></a><span class="lineno">  181</span>&#160;</div>
<div class="line"><a name="l00182"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#af0bb94fbb1f9be47012fddd2e605ff9d">  182</a></span>&#160;                        T** <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#af0bb94fbb1f9be47012fddd2e605ff9d" title="a copy to the levels in the tree.">levels</a>;</div>
<div class="line"><a name="l00183"></a><span class="lineno">  183</span>&#160;</div>
<div class="line"><a name="l00184"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a71139b71eb257852585ef683f6d6626f">  184</a></span>&#160;                        <span class="keywordtype">long</span>* <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a71139b71eb257852585ef683f6d6626f" title="position inside the word, in each level.">slides</a>;</div>
<div class="line"><a name="l00185"></a><span class="lineno">  185</span>&#160;</div>
<div class="line"><a name="l00186"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a05a429cf7e6aeb3410ef1b8bfb9309b4">  186</a></span>&#160;                        <span class="keywordtype">long</span>* <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a05a429cf7e6aeb3410ef1b8bfb9309b4" title="indexes, in each level of the words enumerated.">idxs</a>;</div>
<div class="line"><a name="l00187"></a><span class="lineno">  187</span>&#160;</div>
<div class="line"><a name="l00188"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a753eda77e9e53002362dc0959bdec716">  188</a></span>&#160;                        <span class="keywordtype">long</span>* <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a753eda77e9e53002362dc0959bdec716">lims</a>;<span class="comment">// !&lt; the size of each level.</span></div>
<div class="line"><a name="l00189"></a><span class="lineno">  189</span>&#160;</div>
<div class="line"><a name="l00190"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a6b3b85b991ecc047b2a3c017e2b99c11">  190</a></span>&#160;                        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a6b3b85b991ecc047b2a3c017e2b99c11">logb</a>;<span class="comment">// !&lt; the log of the word size.</span></div>
<div class="line"><a name="l00191"></a><span class="lineno">  191</span>&#160;</div>
<div class="line"><a name="l00192"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a14c2625401e346a77cea18c3e6719ac3">  192</a></span>&#160;                        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a14c2625401e346a77cea18c3e6719ac3" title="the size in bits of a word">word_size</a>;</div>
<div class="line"><a name="l00193"></a><span class="lineno">  193</span>&#160;</div>
<div class="line"><a name="l00194"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a07814f37bc6104b5307dc30e2a68eea9">  194</a></span>&#160;                        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a07814f37bc6104b5307dc30e2a68eea9" title="the size of the vEBTree that is being enumerate, its a simple copy of the value t-&gt;size().">size</a>;</div>
<div class="line"><a name="l00195"></a><span class="lineno">  195</span>&#160;</div>
<div class="line"><a name="l00196"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a8fa26e034afb5e8f376f1e211d62e0de">  196</a></span>&#160;                        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a8fa26e034afb5e8f376f1e211d62e0de" title="the current element in the enumeration">current</a>;</div>
<div class="line"><a name="l00197"></a><span class="lineno">  197</span>&#160;</div>
<div class="line"><a name="l00208"></a><span class="lineno">  208</span>&#160;                        <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#af2d018d04016ac88f295998f3c60eb1e" title="A constructor for a Iterator over a specified vEBTree.">FilterIterator</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a> * t, <a class="code" href="classDirectlyAddressedSet.html">DirectlyAddressedSet&lt;long&gt;</a>* <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a2544e72c3180595601612c00df601918" title="the filter to enumeration">filter</a>);</div>
<div class="line"><a name="l00209"></a><span class="lineno">  209</span>&#160;</div>
<div class="line"><a name="l00222"></a><span class="lineno">  222</span>&#160;                        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a09580d1762d868baf9c7560b0dad05e2" title="Determine the first bit 1 in the word of index idx in the vector of level h, after the specified posi...">bitLeast</a>(<span class="keywordtype">long</span> idx, <span class="keywordtype">long</span> slide, <span class="keywordtype">long</span> h);</div>
<div class="line"><a name="l00223"></a><span class="lineno">  223</span>&#160;</div>
<div class="line"><a name="l00224"></a><span class="lineno">  224</span>&#160;                <span class="keyword">public</span>:</div>
<div class="line"><a name="l00228"></a><span class="lineno">  228</span>&#160;                        <span class="keyword">virtual</span> <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#ad870d22713999534a7c8546328df53d0" title="The destructor.">~FilterIterator</a>();</div>
<div class="line"><a name="l00229"></a><span class="lineno">  229</span>&#160;</div>
<div class="line"><a name="l00238"></a><span class="lineno">  238</span>&#160;                        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a863e95227e516d893ab343f4c2a848ba" title="Start enumeration.">start</a>();</div>
<div class="line"><a name="l00239"></a><span class="lineno">  239</span>&#160;</div>
<div class="line"><a name="l00240"></a><span class="lineno">  240</span>&#160;</div>
<div class="line"><a name="l00252"></a><span class="lineno">  252</span>&#160;                        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a81140313b88b17698b0c48ee6dc3e560" title="Restart enumeration.">restart</a>();</div>
<div class="line"><a name="l00253"></a><span class="lineno">  253</span>&#160;</div>
<div class="line"><a name="l00266"></a><span class="lineno">  266</span>&#160;                        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#aa19b20129bbb3eb5878c10b94801e344" title="Restart enumeration from a specified element.">restartFrom</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00267"></a><span class="lineno">  267</span>&#160;</div>
<div class="line"><a name="l00281"></a><span class="lineno">  281</span>&#160;                        <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#accfed7e47b4c21d1bb189d2492930a36" title="Determine if still there is a element in the set and in the filter not enumerated yet...">hasNext</a>();</div>
<div class="line"><a name="l00282"></a><span class="lineno">  282</span>&#160;</div>
<div class="line"><a name="l00291"></a><span class="lineno">  291</span>&#160;                        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree_1_1FilterIterator.html#aa9b8e11902a867e96a84d5700a006f9f" title="Index of the next element in the set according to the current enumeration.">next</a>();</div>
<div class="line"><a name="l00292"></a><span class="lineno">  292</span>&#160;                };</div>
<div class="line"><a name="l00293"></a><span class="lineno">  293</span>&#160;</div>
<div class="line"><a name="l00304"></a><span class="lineno">  304</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#ac247e12955c43513e74f562154043acb" title="The index of the specified element in the vector of words.">wordIdx</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00305"></a><span class="lineno">  305</span>&#160;</div>
<div class="line"><a name="l00317"></a><span class="lineno">  317</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#a411ea5691e2e29fa27558da575bbc04b" title="The index of the specified element in a word.">inWordIdx</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00318"></a><span class="lineno">  318</span>&#160;</div>
<div class="line"><a name="l00328"></a><span class="lineno">  328</span>&#160;        <span class="keyword">virtual</span> T <a class="code" href="classArrayvEBTree.html#a7007003392118505d3884e51e6218bb3" title="The node in the index i of the leaf level of the tree.">treeNode</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00329"></a><span class="lineno">  329</span>&#160;</div>
<div class="line"><a name="l00346"></a><span class="lineno">  346</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classArrayvEBTree.html#a635cb741c5aeffa93ae513a06a9d2e12" title="Change the value of the i-th word in the array of words.">setNode</a>(<span class="keywordtype">long</span> i, T newnode);</div>
<div class="line"><a name="l00347"></a><span class="lineno">  347</span>&#160;</div>
<div class="line"><a name="l00364"></a><span class="lineno">  364</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classArrayvEBTree.html#add0dd37dfa5047674dc9efdfa60f48e9" title="Change the value of the i-th word in the array of words without update any information in the other l...">setNodeInLevel</a>(<span class="keywordtype">long</span> i, T newnode);</div>
<div class="line"><a name="l00365"></a><span class="lineno">  365</span>&#160;</div>
<div class="line"><a name="l00379"></a><span class="lineno">  379</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#a184eea043a0703a3541723253b4eae28" title="Determine the first bit 1 after the i-th bit in the word that the i-th bit belongs.">nextSetInWord</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00380"></a><span class="lineno">  380</span>&#160;</div>
<div class="line"><a name="l00394"></a><span class="lineno">  394</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#ac18a863eee6d54232ffb651ee5ddcf6c" title="Determine the first bit 1 in the array of words.">firstSetInWord</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00395"></a><span class="lineno">  395</span>&#160;</div>
<div class="line"><a name="l00409"></a><span class="lineno">  409</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#aa7dba9c3fa002463ea492182f4b6fa9d" title="Determine the first bit 0 in the array of words.">firstComplInWord</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00410"></a><span class="lineno">  410</span>&#160;</div>
<div class="line"><a name="l00424"></a><span class="lineno">  424</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#a7121c7f03b562468afd4d95cc3d422ab" title="Determine the first bit 0 after the i-th bit in the word that the i-th bit belongs.">nextComplInWord</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00425"></a><span class="lineno">  425</span>&#160;</div>
<div class="line"><a name="l00439"></a><span class="lineno">  439</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#ac6cd27e6be3b63549c4369cc452f8ea3" title="Count the number of bits 1 in the specified word.">countSetInWord</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00440"></a><span class="lineno">  440</span>&#160;</div>
<div class="line"><a name="l00454"></a><span class="lineno">  454</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#a37708562d2996f6b302b1304c558ae9e" title="Count the number of bits 0 in the specified word.">countComplInWord</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00455"></a><span class="lineno">  455</span>&#160;</div>
<div class="line"><a name="l00467"></a><span class="lineno">  467</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a073c6e8ee0e1c12d2e2552ee4043bf20" title="Change the value to the specified bit to 1.">toSetInLevel</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00468"></a><span class="lineno">  468</span>&#160;</div>
<div class="line"><a name="l00480"></a><span class="lineno">  480</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a8d98a5cf4daaa5afb9a7a17b2980898a" title="Change the value to the specified bit to 0.">toComplInLevel</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00481"></a><span class="lineno">  481</span>&#160;</div>
<div class="line"><a name="l00489"></a><span class="lineno">  489</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a7d2a262570ed4a0cca9c7b26a93c27a3" title="Change the value of all bits to 1.">allToSetInLevel</a>();</div>
<div class="line"><a name="l00490"></a><span class="lineno">  490</span>&#160;</div>
<div class="line"><a name="l00498"></a><span class="lineno">  498</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#ae4908c05f6c6ea3f9bc2600148ea243b" title="Change the value of all bits to 0.">allToComplInLevel</a>();</div>
<div class="line"><a name="l00499"></a><span class="lineno">  499</span>&#160;</div>
<div class="line"><a name="l00500"></a><span class="lineno">  500</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l00501"></a><span class="lineno">  501</span>&#160;</div>
<div class="line"><a name="l00509"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a227a66f64b585f0e31532fa20ecc44a4">  509</a></span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDirectlyAddressedSet.html" title="A static or dynamic set of elements with direct addressing.">DirectlyAddressedSet&lt;long&gt;::Iterator</a>* <a class="code" href="classArrayvEBTree.html#a227a66f64b585f0e31532fa20ecc44a4" title="Start a new iterator for the set represented by this object.">newSetIterator</a>(){</div>
<div class="line"><a name="l00510"></a><span class="lineno">  510</span>&#160;                <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code" href="classArrayvEBTree_1_1Iterator.html" title="A generic iterator on the set of elements.">Iterator</a>(<span class="keyword">this</span>);</div>
<div class="line"><a name="l00511"></a><span class="lineno">  511</span>&#160;        }</div>
<div class="line"><a name="l00512"></a><span class="lineno">  512</span>&#160;</div>
<div class="line"><a name="l00523"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a0ada046e25fc341b1d0bfb53a63d47cc">  523</a></span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDirectlyAddressedSet.html" title="A static or dynamic set of elements with direct addressing.">DirectlyAddressedSet&lt;long&gt;::Iterator</a>* <a class="code" href="classArrayvEBTree.html#a0ada046e25fc341b1d0bfb53a63d47cc" title="Start a new iterator for the set represented by this object with a filter.">newSetIterator</a>(<a class="code" href="classDirectlyAddressedSet.html">DirectlyAddressedSet&lt;long&gt;</a>* filter){</div>
<div class="line"><a name="l00524"></a><span class="lineno">  524</span>&#160;                <span class="keywordflow">return</span> <span class="keyword">new</span> <a class="code" href="classArrayvEBTree_1_1FilterIterator.html">FilterIterator</a>(<span class="keyword">this</span>, filter);</div>
<div class="line"><a name="l00525"></a><span class="lineno">  525</span>&#160;        }</div>
<div class="line"><a name="l00526"></a><span class="lineno">  526</span>&#160;</div>
<div class="line"><a name="l00536"></a><span class="lineno">  536</span>&#160;        <a class="code" href="classArrayvEBTree.html#a3fa65060727c424c0cfc0361fb313b16" title="The base constructor of the class.">ArrayvEBTree</a>(<span class="keywordtype">int</span> sz);</div>
<div class="line"><a name="l00537"></a><span class="lineno">  537</span>&#160;</div>
<div class="line"><a name="l00553"></a><span class="lineno">  553</span>&#160;        <a class="code" href="classArrayvEBTree.html#a3fa65060727c424c0cfc0361fb313b16" title="The base constructor of the class.">ArrayvEBTree</a>(DirectlyAddressedSetFactory&lt;long&gt;* f, <span class="keywordtype">int</span> <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>, <span class="keywordtype">int</span> ht);</div>
<div class="line"><a name="l00554"></a><span class="lineno">  554</span>&#160;</div>
<div class="line"><a name="l00560"></a><span class="lineno">  560</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classArrayvEBTree.html#ac716d830a5fcb6d995527a3251839e3a" title="A destructor.">~ArrayvEBTree</a>();</div>
<div class="line"><a name="l00561"></a><span class="lineno">  561</span>&#160;</div>
<div class="line"><a name="l00570"></a><span class="lineno">  570</span>&#160;        <span class="keyword">virtual</span> <a class="code" href="classDirectlyAddressedSet.html">DirectlyAddressedSet&lt;long&gt;</a>* <a class="code" href="classArrayvEBTree.html#af63174b7108e17a93a1cb1c8b3de652e" title="Create a copy of this object.">clone</a>();</div>
<div class="line"><a name="l00571"></a><span class="lineno">  571</span>&#160;</div>
<div class="line"><a name="l00582"></a><span class="lineno">  582</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#a6036c4756a28f364f661dc0d50646eb4" title="Determine the next element in the set of the specified element.">nextSetElement</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00583"></a><span class="lineno">  583</span>&#160;</div>
<div class="line"><a name="l00594"></a><span class="lineno">  594</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#ab04c66b500b23e4df86685d309826d86" title="Determine the next element in the set, in increasing order, of the specified element.">nextSetElementInLevel</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00595"></a><span class="lineno">  595</span>&#160;</div>
<div class="line"><a name="l00606"></a><span class="lineno">  606</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#a48b51595735fe7cd54e01b3055e2e32b" title="Determine the next element in the set, in increasing order, of the specified element.">nextComplElementInLevel</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00607"></a><span class="lineno">  607</span>&#160;</div>
<div class="line"><a name="l00617"></a><span class="lineno">  617</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00618"></a><span class="lineno">  618</span>&#160;</div>
<div class="line"><a name="l00628"></a><span class="lineno">  628</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00629"></a><span class="lineno">  629</span>&#160;</div>
<div class="line"><a name="l00630"></a><span class="lineno">  630</span>&#160;</div>
<div class="line"><a name="l00642"></a><span class="lineno">  642</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classArrayvEBTree.html#ab104347ec00cdf4621bf227354cda97c" title="Determines whether the specified element is in this set.">isInSet</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00643"></a><span class="lineno">  643</span>&#160;</div>
<div class="line"><a name="l00655"></a><span class="lineno">  655</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classArrayvEBTree.html#afb7667e1adb8e7aa75a4922d7c2527cb" title="Determines whether the specified element is in this complement.">isInCompl</a>(<span class="keywordtype">long</span> i);</div>
<div class="line"><a name="l00656"></a><span class="lineno">  656</span>&#160;</div>
<div class="line"><a name="l00657"></a><span class="lineno">  657</span>&#160;</div>
<div class="line"><a name="l00670"></a><span class="lineno">  670</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span>* <a class="code" href="classArrayvEBTree.html#a29b99e86ee4bbfc2dc35470ee8b563f1" title="Returns an array containing all of the elements in this set in increasing order.">toArray</a>(<span class="keywordtype">long</span>* <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>);</div>
<div class="line"><a name="l00671"></a><span class="lineno">  671</span>&#160;</div>
<div class="line"><a name="l00680"></a><span class="lineno">  680</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>();</div>
<div class="line"><a name="l00681"></a><span class="lineno">  681</span>&#160;</div>
<div class="line"><a name="l00691"></a><span class="lineno">  691</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#a997e188999c994a537e22eb7cc801d1b" title="The size of the vector of words.">sizeInWord</a>();</div>
<div class="line"><a name="l00692"></a><span class="lineno">  692</span>&#160;</div>
<div class="line"><a name="l00700"></a><span class="lineno">  700</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a23abf9f3e7cd4b36454240d3dfb2001d" title="Add all the elements of the universe to the set.">allToSet</a>();</div>
<div class="line"><a name="l00701"></a><span class="lineno">  701</span>&#160;</div>
<div class="line"><a name="l00709"></a><span class="lineno">  709</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a77964dcd987649572435fbc1847e28ba" title="Add all the elements of the universe to the complement.">allToCompl</a>();</div>
<div class="line"><a name="l00710"></a><span class="lineno">  710</span>&#160;</div>
<div class="line"><a name="l00711"></a><span class="lineno">  711</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">bool</span> <a class="code" href="classArrayvEBTree.html#a60875493f7c59c59a61e7cae2259316a" title="Verify if the current set represeted by this object is empty.">isEmpty</a>();</div>
<div class="line"><a name="l00712"></a><span class="lineno">  712</span>&#160;</div>
<div class="line"><a name="l00723"></a><span class="lineno">  723</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#ac586f1424b6fc9b0049ab5d196d056bf" title="The operation of union between the set represented by this object and the set represented by v...">setUnionSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v);</div>
<div class="line"><a name="l00724"></a><span class="lineno">  724</span>&#160;</div>
<div class="line"><a name="l00735"></a><span class="lineno">  735</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#ac586f1424b6fc9b0049ab5d196d056bf" title="The operation of union between the set represented by this object and the set represented by v...">setUnionSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* ret);</div>
<div class="line"><a name="l00736"></a><span class="lineno">  736</span>&#160;</div>
<div class="line"><a name="l00747"></a><span class="lineno">  747</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#aa8b2fb704a39091782e70abe6843f04f" title="The operation of union between the set represented by this object and the set represented by v...">setIntersecSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v);</div>
<div class="line"><a name="l00748"></a><span class="lineno">  748</span>&#160;</div>
<div class="line"><a name="l00759"></a><span class="lineno">  759</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#aa8b2fb704a39091782e70abe6843f04f" title="The operation of union between the set represented by this object and the set represented by v...">setIntersecSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* ret);</div>
<div class="line"><a name="l00760"></a><span class="lineno">  760</span>&#160;</div>
<div class="line"><a name="l00761"></a><span class="lineno">  761</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#aa33810c38fe8fe272504dcc3ce9bde13">setDiffSimetricSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v);</div>
<div class="line"><a name="l00762"></a><span class="lineno">  762</span>&#160;</div>
<div class="line"><a name="l00763"></a><span class="lineno">  763</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a83364fe9bc4ec45082a7fb031aae917d">setDiffSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v);</div>
<div class="line"><a name="l00764"></a><span class="lineno">  764</span>&#160;</div>
<div class="line"><a name="l00765"></a><span class="lineno">  765</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#aa33810c38fe8fe272504dcc3ce9bde13">setDiffSimetricSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res);</div>
<div class="line"><a name="l00766"></a><span class="lineno">  766</span>&#160;</div>
<div class="line"><a name="l00767"></a><span class="lineno">  767</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a83364fe9bc4ec45082a7fb031aae917d">setDiffSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res);</div>
<div class="line"><a name="l00768"></a><span class="lineno">  768</span>&#160;</div>
<div class="line"><a name="l00769"></a><span class="lineno">  769</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a27aa2e8b426adbb6df350f8f8abdd0ac">complUnionSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v);</div>
<div class="line"><a name="l00770"></a><span class="lineno">  770</span>&#160;</div>
<div class="line"><a name="l00771"></a><span class="lineno">  771</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a4967f0271560cccee164df6d688021bc">complDiffSimetricSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v);</div>
<div class="line"><a name="l00772"></a><span class="lineno">  772</span>&#160;</div>
<div class="line"><a name="l00773"></a><span class="lineno">  773</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a0b08a3b3c8360bb05a6cc689bad97548">complIntersecSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v);</div>
<div class="line"><a name="l00774"></a><span class="lineno">  774</span>&#160;</div>
<div class="line"><a name="l00775"></a><span class="lineno">  775</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#ae60c831276e2251050347b2d6ff6c623">complDiffSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v);</div>
<div class="line"><a name="l00776"></a><span class="lineno">  776</span>&#160;</div>
<div class="line"><a name="l00777"></a><span class="lineno">  777</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a27aa2e8b426adbb6df350f8f8abdd0ac">complUnionSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res);</div>
<div class="line"><a name="l00778"></a><span class="lineno">  778</span>&#160;</div>
<div class="line"><a name="l00779"></a><span class="lineno">  779</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a4967f0271560cccee164df6d688021bc">complDiffSimetricSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res);</div>
<div class="line"><a name="l00780"></a><span class="lineno">  780</span>&#160;</div>
<div class="line"><a name="l00781"></a><span class="lineno">  781</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a0b08a3b3c8360bb05a6cc689bad97548">complIntersecSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res);</div>
<div class="line"><a name="l00782"></a><span class="lineno">  782</span>&#160;</div>
<div class="line"><a name="l00783"></a><span class="lineno">  783</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#ae60c831276e2251050347b2d6ff6c623">complDiffSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res);</div>
<div class="line"><a name="l00784"></a><span class="lineno">  784</span>&#160;</div>
<div class="line"><a name="l00785"></a><span class="lineno">  785</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#ae79457c615a968f941ca039290255d8a">setUnionCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v);</div>
<div class="line"><a name="l00786"></a><span class="lineno">  786</span>&#160;</div>
<div class="line"><a name="l00787"></a><span class="lineno">  787</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a61df6aaf918dd124ed1bc28ee2d61519">setDiffSimetricCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v);</div>
<div class="line"><a name="l00788"></a><span class="lineno">  788</span>&#160;</div>
<div class="line"><a name="l00789"></a><span class="lineno">  789</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#adc2ffe19e223a72c66b51730163c2d26">setIntersecCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v);</div>
<div class="line"><a name="l00790"></a><span class="lineno">  790</span>&#160;</div>
<div class="line"><a name="l00791"></a><span class="lineno">  791</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a66d503faf6d49dd6a0292f9a9b8b3cd0">setDiffCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v);</div>
<div class="line"><a name="l00792"></a><span class="lineno">  792</span>&#160;</div>
<div class="line"><a name="l00793"></a><span class="lineno">  793</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#ae79457c615a968f941ca039290255d8a">setUnionCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res);</div>
<div class="line"><a name="l00794"></a><span class="lineno">  794</span>&#160;</div>
<div class="line"><a name="l00795"></a><span class="lineno">  795</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a61df6aaf918dd124ed1bc28ee2d61519">setDiffSimetricCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res);</div>
<div class="line"><a name="l00796"></a><span class="lineno">  796</span>&#160;</div>
<div class="line"><a name="l00797"></a><span class="lineno">  797</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#adc2ffe19e223a72c66b51730163c2d26">setIntersecCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res);</div>
<div class="line"><a name="l00798"></a><span class="lineno">  798</span>&#160;</div>
<div class="line"><a name="l00799"></a><span class="lineno">  799</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a66d503faf6d49dd6a0292f9a9b8b3cd0">setDiffCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res);</div>
<div class="line"><a name="l00800"></a><span class="lineno">  800</span>&#160;</div>
<div class="line"><a name="l00801"></a><span class="lineno">  801</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#abcd6e8cee331bbc49f9b36f5102a3ec3">complUnionCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v);</div>
<div class="line"><a name="l00802"></a><span class="lineno">  802</span>&#160;</div>
<div class="line"><a name="l00803"></a><span class="lineno">  803</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a946fde97c4c461900c6c1e5ff053d65b">complDiffSimetricCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v);</div>
<div class="line"><a name="l00804"></a><span class="lineno">  804</span>&#160;</div>
<div class="line"><a name="l00805"></a><span class="lineno">  805</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a1a4c451e61971b4493bb9daefc5b559c">complIntersecCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v);</div>
<div class="line"><a name="l00806"></a><span class="lineno">  806</span>&#160;</div>
<div class="line"><a name="l00807"></a><span class="lineno">  807</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#aab6c709db21c6d3f635add33ef487858">complDiffCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v);</div>
<div class="line"><a name="l00808"></a><span class="lineno">  808</span>&#160;</div>
<div class="line"><a name="l00809"></a><span class="lineno">  809</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#abcd6e8cee331bbc49f9b36f5102a3ec3">complUnionCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res);</div>
<div class="line"><a name="l00810"></a><span class="lineno">  810</span>&#160;</div>
<div class="line"><a name="l00811"></a><span class="lineno">  811</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a946fde97c4c461900c6c1e5ff053d65b">complDiffSimetricCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res);</div>
<div class="line"><a name="l00812"></a><span class="lineno">  812</span>&#160;</div>
<div class="line"><a name="l00813"></a><span class="lineno">  813</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a1a4c451e61971b4493bb9daefc5b559c">complIntersecCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res);</div>
<div class="line"><a name="l00814"></a><span class="lineno">  814</span>&#160;</div>
<div class="line"><a name="l00815"></a><span class="lineno">  815</span>&#160;        <span class="keyword">virtual</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#aab6c709db21c6d3f635add33ef487858">complDiffCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res);</div>
<div class="line"><a name="l00816"></a><span class="lineno">  816</span>&#160;</div>
<div class="line"><a name="l00817"></a><span class="lineno">  817</span>&#160;};</div>
<div class="line"><a name="l00818"></a><span class="lineno">  818</span>&#160;</div>
<div class="line"><a name="l00819"></a><span class="lineno">  819</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00820"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#ac716d830a5fcb6d995527a3251839e3a">  820</a></span>&#160;<a class="code" href="classArrayvEBTree.html#ac716d830a5fcb6d995527a3251839e3a" title="A destructor.">ArrayvEBTree&lt;T&gt;::~ArrayvEBTree</a>(){</div>
<div class="line"><a name="l00821"></a><span class="lineno">  821</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 1; i &lt; MultiLevelDirectlyAddressedSet&lt;T&gt;::height ; i++){</div>
<div class="line"><a name="l00822"></a><span class="lineno">  822</span>&#160;                <span class="keyword">delete</span> <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[i];</div>
<div class="line"><a name="l00823"></a><span class="lineno">  823</span>&#160;        }</div>
<div class="line"><a name="l00824"></a><span class="lineno">  824</span>&#160;        <span class="keyword">delete</span> <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l00825"></a><span class="lineno">  825</span>&#160;        <span class="keyword">delete</span> <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::bitvector</a>;</div>
<div class="line"><a name="l00826"></a><span class="lineno">  826</span>&#160;}</div>
<div class="line"><a name="l00827"></a><span class="lineno">  827</span>&#160;</div>
<div class="line"><a name="l00828"></a><span class="lineno">  828</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00829"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a7007003392118505d3884e51e6218bb3">  829</a></span>&#160;<span class="keyword">inline</span> T <a class="code" href="classArrayvEBTree.html#a7007003392118505d3884e51e6218bb3" title="The node in the index i of the leaf level of the tree.">ArrayvEBTree&lt;T&gt;::treeNode</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l00830"></a><span class="lineno">  830</span>&#160;        <span class="comment">//just retrieve a position in the vector</span></div>
<div class="line"><a name="l00831"></a><span class="lineno">  831</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[i];</div>
<div class="line"><a name="l00832"></a><span class="lineno">  832</span>&#160;}</div>
<div class="line"><a name="l00833"></a><span class="lineno">  833</span>&#160;</div>
<div class="line"><a name="l00834"></a><span class="lineno">  834</span>&#160;</div>
<div class="line"><a name="l00835"></a><span class="lineno">  835</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00836"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a3fa65060727c424c0cfc0361fb313b16">  836</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classArrayvEBTree.html#a3fa65060727c424c0cfc0361fb313b16" title="The base constructor of the class.">ArrayvEBTree&lt;T&gt;::ArrayvEBTree</a>(<span class="keywordtype">int</span> sz):<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet</a>&lt;T&gt;(sz){</div>
<div class="line"><a name="l00837"></a><span class="lineno">  837</span>&#160;        <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a> = ((sz &gt;&gt; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::logb</a>) &lt;&lt; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::logb</a>) == sz? (sz &gt;&gt; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::logb</a>) : (sz &gt;&gt; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::logb</a>) + 1;</div>
<div class="line"><a name="l00838"></a><span class="lineno">  838</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a> == 0) <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a> = 1;</div>
<div class="line"><a name="l00839"></a><span class="lineno">  839</span>&#160;        <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> = <span class="keyword">new</span> T[<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>];</div>
<div class="line"><a name="l00840"></a><span class="lineno">  840</span>&#160;        <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a> = <span class="keyword">new</span> <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;</a>*[1];</div>
<div class="line"><a name="l00841"></a><span class="lineno">  841</span>&#160;        <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[0] = <span class="keyword">this</span>;</div>
<div class="line"><a name="l00842"></a><span class="lineno">  842</span>&#160;        <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> = 1;</div>
<div class="line"><a name="l00843"></a><span class="lineno">  843</span>&#160;        memset(<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>,0, <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>*<span class="keyword">sizeof</span>(T));</div>
<div class="line"><a name="l00844"></a><span class="lineno">  844</span>&#160;}</div>
<div class="line"><a name="l00845"></a><span class="lineno">  845</span>&#160;</div>
<div class="line"><a name="l00846"></a><span class="lineno">  846</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00847"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#accd64506cdaa0b5ea777a7e80a1682fd">  847</a></span>&#160;<a class="code" href="classArrayvEBTree.html#a3fa65060727c424c0cfc0361fb313b16" title="The base constructor of the class.">ArrayvEBTree&lt;T&gt;::ArrayvEBTree</a>(DirectlyAddressedSetFactory&lt;long&gt;* f, <span class="keywordtype">int</span> <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>, <span class="keywordtype">int</span> ht):<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet</a>&lt;T&gt;(size){</div>
<div class="line"><a name="l00848"></a><span class="lineno">  848</span>&#160;        <span class="comment">//initialize and allocate memory</span></div>
<div class="line"><a name="l00849"></a><span class="lineno">  849</span>&#160;        <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a> = ((size &gt;&gt; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::logb</a>) &lt;&lt; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::logb</a>) == size? (size &gt;&gt; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::logb</a>) : (size &gt;&gt; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::logb</a>) + 1;</div>
<div class="line"><a name="l00850"></a><span class="lineno">  850</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a> == 0) <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a> = 1;</div>
<div class="line"><a name="l00851"></a><span class="lineno">  851</span>&#160;        <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> = <span class="keyword">new</span> T[<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>];</div>
<div class="line"><a name="l00852"></a><span class="lineno">  852</span>&#160;        <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a> = <span class="keyword">new</span> <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;</a>*[ht + 1];</div>
<div class="line"><a name="l00853"></a><span class="lineno">  853</span>&#160;        <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[0] = <span class="keyword">this</span>;</div>
<div class="line"><a name="l00854"></a><span class="lineno">  854</span>&#160;        memset(<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>,0, <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>*<span class="keyword">sizeof</span>(T));</div>
<div class="line"><a name="l00855"></a><span class="lineno">  855</span>&#160;        <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> = ht + 1;</div>
<div class="line"><a name="l00856"></a><span class="lineno">  856</span>&#160;        <span class="keywordtype">int</span> sz = <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l00857"></a><span class="lineno">  857</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 1; i &lt;= ht; i++){</div>
<div class="line"><a name="l00858"></a><span class="lineno">  858</span>&#160;                <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[i] = (<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;</a>*)f-&gt;newOrderedSet(sz);</div>
<div class="line"><a name="l00859"></a><span class="lineno">  859</span>&#160;                sz = ((sz &gt;&gt; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::logb</a>) &lt;&lt; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::logb</a>) == sz? (sz &gt;&gt; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::logb</a>) : (sz &gt;&gt; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::logb</a>) + 1;</div>
<div class="line"><a name="l00860"></a><span class="lineno">  860</span>&#160;                <span class="keywordflow">if</span>(sz == 0) sz = 1;</div>
<div class="line"><a name="l00861"></a><span class="lineno">  861</span>&#160;        }</div>
<div class="line"><a name="l00862"></a><span class="lineno">  862</span>&#160;</div>
<div class="line"><a name="l00863"></a><span class="lineno">  863</span>&#160;        <span class="comment">//link the upper levels of the current tree</span></div>
<div class="line"><a name="l00864"></a><span class="lineno">  864</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">int</span> i = 1; i &lt;=ht; i++){</div>
<div class="line"><a name="l00865"></a><span class="lineno">  865</span>&#160;                <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[i]-&gt;levels = <span class="keyword">new</span> <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;</a>*[ht + 1 - i];</div>
<div class="line"><a name="l00866"></a><span class="lineno">  866</span>&#160;                <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[i]-&gt;<a class="code" href="classMultiLevelDirectlyAddressedSet.html#afed049ed58d442204d2e5d9c34491520" title="number of levels">height</a> = ht + 1 - i ;</div>
<div class="line"><a name="l00867"></a><span class="lineno">  867</span>&#160;                <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[i]-&gt;levels[0] = <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[i];</div>
<div class="line"><a name="l00868"></a><span class="lineno">  868</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">int</span> j = i+1; j &lt;= ht; j++){</div>
<div class="line"><a name="l00869"></a><span class="lineno">  869</span>&#160;                        <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[i]-&gt;levels[j - i] = <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[j];</div>
<div class="line"><a name="l00870"></a><span class="lineno">  870</span>&#160;                }</div>
<div class="line"><a name="l00871"></a><span class="lineno">  871</span>&#160;        }</div>
<div class="line"><a name="l00872"></a><span class="lineno">  872</span>&#160;}</div>
<div class="line"><a name="l00873"></a><span class="lineno">  873</span>&#160;</div>
<div class="line"><a name="l00874"></a><span class="lineno">  874</span>&#160;</div>
<div class="line"><a name="l00875"></a><span class="lineno">  875</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00876"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#af63174b7108e17a93a1cb1c8b3de652e">  876</a></span>&#160;<span class="keyword">inline</span> <a class="code" href="classDirectlyAddressedSet.html">DirectlyAddressedSet&lt;long&gt;</a>* <a class="code" href="classArrayvEBTree.html#af63174b7108e17a93a1cb1c8b3de652e" title="Create a copy of this object.">ArrayvEBTree&lt;T&gt;::clone</a>(){</div>
<div class="line"><a name="l00877"></a><span class="lineno">  877</span>&#160;        <span class="comment">//create the copy</span></div>
<div class="line"><a name="l00878"></a><span class="lineno">  878</span>&#160;        <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="classArrayvEBTree.html#af63174b7108e17a93a1cb1c8b3de652e" title="Create a copy of this object.">clone</a> = <span class="keyword">new</span> <a class="code" href="classArrayvEBTree.html#a3fa65060727c424c0cfc0361fb313b16" title="The base constructor of the class.">ArrayvEBTree</a>(<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::n</a>);</div>
<div class="line"><a name="l00879"></a><span class="lineno">  879</span>&#160;        <span class="comment">//copy the whole vector</span></div>
<div class="line"><a name="l00880"></a><span class="lineno">  880</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l00881"></a><span class="lineno">  881</span>&#160;                clone-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[i] = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[i];</div>
<div class="line"><a name="l00882"></a><span class="lineno">  882</span>&#160;        }</div>
<div class="line"><a name="l00883"></a><span class="lineno">  883</span>&#160;        clone-&gt;levels[0] = <a class="code" href="classArrayvEBTree.html#af63174b7108e17a93a1cb1c8b3de652e" title="Create a copy of this object.">clone</a>;</div>
<div class="line"><a name="l00884"></a><span class="lineno">  884</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = 1; j &lt; MultiLevelDirectlyAddressedSet&lt;T&gt;::height; j++){</div>
<div class="line"><a name="l00885"></a><span class="lineno">  885</span>&#160;                clone-&gt;levels[j] = (<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[j]-&gt;<a class="code" href="classArrayvEBTree.html#af63174b7108e17a93a1cb1c8b3de652e" title="Create a copy of this object.">clone</a>();</div>
<div class="line"><a name="l00886"></a><span class="lineno">  886</span>&#160;        }</div>
<div class="line"><a name="l00887"></a><span class="lineno">  887</span>&#160;        <span class="keywordflow">return</span> (<a class="code" href="classDirectlyAddressedSet.html">DirectlyAddressedSet&lt;long&gt;</a>*)<a class="code" href="classArrayvEBTree.html#af63174b7108e17a93a1cb1c8b3de652e" title="Create a copy of this object.">clone</a>;</div>
<div class="line"><a name="l00888"></a><span class="lineno">  888</span>&#160;}</div>
<div class="line"><a name="l00889"></a><span class="lineno">  889</span>&#160;</div>
<div class="line"><a name="l00890"></a><span class="lineno">  890</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00891"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">  891</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">ArrayvEBTree&lt;T&gt;::bitLeast</a>(<span class="keywordtype">long</span> idx, <span class="keywordtype">long</span> slide, <span class="keywordtype">long</span> h){</div>
<div class="line"><a name="l00892"></a><span class="lineno">  892</span>&#160;        <span class="keywordflow">return</span> builtinLeast&lt;T&gt;(((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[h])-&gt;vector[idx] &amp; <a class="code" href="classBitTools.html#a282ef6cebdba59e5ca064290ec898d10">posmasksimp</a>[slide]);</div>
<div class="line"><a name="l00893"></a><span class="lineno">  893</span>&#160;}</div>
<div class="line"><a name="l00894"></a><span class="lineno">  894</span>&#160;</div>
<div class="line"><a name="l00895"></a><span class="lineno">  895</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00896"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a6036c4756a28f364f661dc0d50646eb4">  896</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#a6036c4756a28f364f661dc0d50646eb4" title="Determine the next element in the set of the specified element.">ArrayvEBTree&lt;T&gt;::nextSetElement</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l00897"></a><span class="lineno">  897</span>&#160;</div>
<div class="line"><a name="l00898"></a><span class="lineno">  898</span>&#160;        <span class="keywordtype">long</span> h = 0;</div>
<div class="line"><a name="l00899"></a><span class="lineno">  899</span>&#160;        <span class="keywordtype">long</span> bit = 0;</div>
<div class="line"><a name="l00900"></a><span class="lineno">  900</span>&#160;</div>
<div class="line"><a name="l00901"></a><span class="lineno">  901</span>&#160;        <span class="keywordtype">long</span> index[<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a>];</div>
<div class="line"><a name="l00902"></a><span class="lineno">  902</span>&#160;        <span class="keywordtype">long</span> slide[<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a>];</div>
<div class="line"><a name="l00903"></a><span class="lineno">  903</span>&#160;        <span class="keywordtype">long</span> lim[<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a>];</div>
<div class="line"><a name="l00904"></a><span class="lineno">  904</span>&#160;        index[0] = i &gt;&gt; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::logb</a>;</div>
<div class="line"><a name="l00905"></a><span class="lineno">  905</span>&#160;        slide[0] = i &amp; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::maskb</a>;</div>
<div class="line"><a name="l00906"></a><span class="lineno">  906</span>&#160;        lim[0] = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[0])-&gt;vectorsz;</div>
<div class="line"><a name="l00907"></a><span class="lineno">  907</span>&#160;</div>
<div class="line"><a name="l00908"></a><span class="lineno">  908</span>&#160;        bit = <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">bitLeast</a>(index[0], slide[0], 0);</div>
<div class="line"><a name="l00909"></a><span class="lineno">  909</span>&#160;</div>
<div class="line"><a name="l00910"></a><span class="lineno">  910</span>&#160;        <span class="keywordflow">while</span>(bit == -1 &amp;&amp; h &lt; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> - 1){</div>
<div class="line"><a name="l00911"></a><span class="lineno">  911</span>&#160;                h++;</div>
<div class="line"><a name="l00912"></a><span class="lineno">  912</span>&#160;                index[h] = index[h-1] &lt;&lt; MultiLevelDirectlyAddressedSet&lt;T&gt;::logb;</div>
<div class="line"><a name="l00913"></a><span class="lineno">  913</span>&#160;                slide[h] = index[h-1] &amp; MultiLevelDirectlyAddressedSet&lt;T&gt;::maskb;</div>
<div class="line"><a name="l00914"></a><span class="lineno">  914</span>&#160;                lim[h] = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[0])-&gt;vectorsz;</div>
<div class="line"><a name="l00915"></a><span class="lineno">  915</span>&#160;                <span class="keywordflow">if</span>(++slide[h] &gt;= <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::word_size</a>){</div>
<div class="line"><a name="l00916"></a><span class="lineno">  916</span>&#160;                        slide[h] = 0;</div>
<div class="line"><a name="l00917"></a><span class="lineno">  917</span>&#160;                        <span class="keywordflow">if</span>(++index[h] &gt;= lim[h]) <span class="keywordflow">return</span> <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::n</a>+1;</div>
<div class="line"><a name="l00918"></a><span class="lineno">  918</span>&#160;                }</div>
<div class="line"><a name="l00919"></a><span class="lineno">  919</span>&#160;                bit = <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">bitLeast</a>(index[h], slide[h], h);</div>
<div class="line"><a name="l00920"></a><span class="lineno">  920</span>&#160;        }</div>
<div class="line"><a name="l00921"></a><span class="lineno">  921</span>&#160;</div>
<div class="line"><a name="l00922"></a><span class="lineno">  922</span>&#160;        <span class="keywordflow">while</span>(bit == -1 &amp;&amp; index[h] &lt; lim[h] - 1){</div>
<div class="line"><a name="l00923"></a><span class="lineno">  923</span>&#160;                bit = <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">bitLeast</a>(++index[h], 0, h);</div>
<div class="line"><a name="l00924"></a><span class="lineno">  924</span>&#160;        }</div>
<div class="line"><a name="l00925"></a><span class="lineno">  925</span>&#160;</div>
<div class="line"><a name="l00926"></a><span class="lineno">  926</span>&#160;        <span class="keywordflow">if</span>(bit != -1){</div>
<div class="line"><a name="l00927"></a><span class="lineno">  927</span>&#160;                slide[h] = bit;</div>
<div class="line"><a name="l00928"></a><span class="lineno">  928</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = h - 1 ; i &gt;= 0; i--){</div>
<div class="line"><a name="l00929"></a><span class="lineno">  929</span>&#160;                        index[i] = (index[i+1] &lt;&lt; MultiLevelDirectlyAddressedSet&lt;T&gt;::logb) + slide[i+1];</div>
<div class="line"><a name="l00930"></a><span class="lineno">  930</span>&#160;                        <span class="keywordflow">if</span>(index[i] &gt;= lim[i]) <span class="keywordflow">return</span> <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::n</a>+1;</div>
<div class="line"><a name="l00931"></a><span class="lineno">  931</span>&#160;                        slide[i] = <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">bitLeast</a>(index[i], 0, i);</div>
<div class="line"><a name="l00932"></a><span class="lineno">  932</span>&#160;                }</div>
<div class="line"><a name="l00933"></a><span class="lineno">  933</span>&#160;                <span class="keywordflow">return</span> (index[0] &lt;&lt; MultiLevelDirectlyAddressedSet&lt;T&gt;::logb) + slide[0];</div>
<div class="line"><a name="l00934"></a><span class="lineno">  934</span>&#160;        }</div>
<div class="line"><a name="l00935"></a><span class="lineno">  935</span>&#160;</div>
<div class="line"><a name="l00936"></a><span class="lineno">  936</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::n</a>+1;</div>
<div class="line"><a name="l00937"></a><span class="lineno">  937</span>&#160;}</div>
<div class="line"><a name="l00938"></a><span class="lineno">  938</span>&#160;</div>
<div class="line"><a name="l00939"></a><span class="lineno">  939</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00940"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#ab04c66b500b23e4df86685d309826d86">  940</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#ab04c66b500b23e4df86685d309826d86" title="Determine the next element in the set, in increasing order, of the specified element.">ArrayvEBTree&lt;T&gt;::nextSetElementInLevel</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l00941"></a><span class="lineno">  941</span>&#160;</div>
<div class="line"><a name="l00942"></a><span class="lineno">  942</span>&#160;        <span class="keywordflow">if</span>(i &gt;= <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::n</a>) <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00943"></a><span class="lineno">  943</span>&#160;</div>
<div class="line"><a name="l00944"></a><span class="lineno">  944</span>&#160;        <span class="keywordtype">long</span> index = <a class="code" href="classArrayvEBTree.html#ac247e12955c43513e74f562154043acb" title="The index of the specified element in the vector of words.">wordIdx</a>(i);<span class="comment">//index of the word</span></div>
<div class="line"><a name="l00945"></a><span class="lineno">  945</span>&#160;</div>
<div class="line"><a name="l00946"></a><span class="lineno">  946</span>&#160;        <span class="comment">//look in the word of i for the next one</span></div>
<div class="line"><a name="l00947"></a><span class="lineno">  947</span>&#160;        <span class="keywordtype">long</span> inword = builtinLeast&lt;T&gt;(<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[index] &amp; <a class="code" href="classBitTools.html#a982b089af5f9175d032bbc853ea0c5ed">posmasklsimp</a>[<a class="code" href="classArrayvEBTree.html#a411ea5691e2e29fa27558da575bbc04b" title="The index of the specified element in a word.">inWordIdx</a>(i)]);</div>
<div class="line"><a name="l00948"></a><span class="lineno">  948</span>&#160;</div>
<div class="line"><a name="l00949"></a><span class="lineno">  949</span>&#160;        <span class="comment">//if a found it, return</span></div>
<div class="line"><a name="l00950"></a><span class="lineno">  950</span>&#160;        <span class="keywordflow">if</span>(inword != -1) <span class="keywordflow">return</span> inword  + (index &lt;&lt; MultiLevelDirectlyAddressedSet&lt;T&gt;::logb);</div>
<div class="line"><a name="l00951"></a><span class="lineno">  951</span>&#160;</div>
<div class="line"><a name="l00952"></a><span class="lineno">  952</span>&#160;        <span class="comment">//look in the rest of the vector</span></div>
<div class="line"><a name="l00953"></a><span class="lineno">  953</span>&#160;        index++;</div>
<div class="line"><a name="l00954"></a><span class="lineno">  954</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = index; j &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; j++){</div>
<div class="line"><a name="l00955"></a><span class="lineno">  955</span>&#160;                inword = builtinLeast&lt;T&gt;(<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[j]);</div>
<div class="line"><a name="l00956"></a><span class="lineno">  956</span>&#160;                <span class="keywordflow">if</span>(inword &gt; 0) <span class="keywordflow">return</span> inword + (j &lt;&lt; MultiLevelDirectlyAddressedSet&lt;T&gt;::logb) ;</div>
<div class="line"><a name="l00957"></a><span class="lineno">  957</span>&#160;        }</div>
<div class="line"><a name="l00958"></a><span class="lineno">  958</span>&#160;        <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00959"></a><span class="lineno">  959</span>&#160;}</div>
<div class="line"><a name="l00960"></a><span class="lineno">  960</span>&#160;</div>
<div class="line"><a name="l00961"></a><span class="lineno">  961</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00962"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a48b51595735fe7cd54e01b3055e2e32b">  962</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#a48b51595735fe7cd54e01b3055e2e32b" title="Determine the next element in the set, in increasing order, of the specified element.">ArrayvEBTree&lt;T&gt;::nextComplElementInLevel</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l00963"></a><span class="lineno">  963</span>&#160;        <span class="comment">//for each element, tests if it is in the complement</span></div>
<div class="line"><a name="l00964"></a><span class="lineno">  964</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = i; j &lt; MultiLevelDirectlyAddressedSet&lt;T&gt;::n; j++){</div>
<div class="line"><a name="l00965"></a><span class="lineno">  965</span>&#160;                <span class="keywordflow">if</span>(<a class="code" href="classArrayvEBTree.html#afb7667e1adb8e7aa75a4922d7c2527cb" title="Determines whether the specified element is in this complement.">isInCompl</a>(j)) <span class="keywordflow">return</span> j;</div>
<div class="line"><a name="l00966"></a><span class="lineno">  966</span>&#160;        }</div>
<div class="line"><a name="l00967"></a><span class="lineno">  967</span>&#160;        <span class="keywordflow">return</span> -1;</div>
<div class="line"><a name="l00968"></a><span class="lineno">  968</span>&#160;}</div>
<div class="line"><a name="l00969"></a><span class="lineno">  969</span>&#160;</div>
<div class="line"><a name="l00970"></a><span class="lineno">  970</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00971"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a411ea5691e2e29fa27558da575bbc04b">  971</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#a411ea5691e2e29fa27558da575bbc04b" title="The index of the specified element in a word.">ArrayvEBTree&lt;T&gt;::inWordIdx</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l00972"></a><span class="lineno">  972</span>&#160;        <span class="keywordflow">return</span> i &amp; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::maskb</a>;</div>
<div class="line"><a name="l00973"></a><span class="lineno">  973</span>&#160;}</div>
<div class="line"><a name="l00974"></a><span class="lineno">  974</span>&#160;</div>
<div class="line"><a name="l00975"></a><span class="lineno">  975</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00976"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#ac247e12955c43513e74f562154043acb">  976</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#ac247e12955c43513e74f562154043acb" title="The index of the specified element in the vector of words.">ArrayvEBTree&lt;T&gt;::wordIdx</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l00977"></a><span class="lineno">  977</span>&#160;        <span class="keywordflow">return</span> i &gt;&gt; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::logb</a>;</div>
<div class="line"><a name="l00978"></a><span class="lineno">  978</span>&#160;}</div>
<div class="line"><a name="l00979"></a><span class="lineno">  979</span>&#160;</div>
<div class="line"><a name="l00980"></a><span class="lineno">  980</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00981"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a073c6e8ee0e1c12d2e2552ee4043bf20">  981</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a073c6e8ee0e1c12d2e2552ee4043bf20" title="Change the value to the specified bit to 1.">ArrayvEBTree&lt;T&gt;::toSetInLevel</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l00982"></a><span class="lineno">  982</span>&#160;        <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[<a class="code" href="classArrayvEBTree.html#ac247e12955c43513e74f562154043acb" title="The index of the specified element in the vector of words.">wordIdx</a>(i)] |= (1LL &lt;&lt; (<a class="code" href="classArrayvEBTree.html#a411ea5691e2e29fa27558da575bbc04b" title="The index of the specified element in a word.">inWordIdx</a>(i)));</div>
<div class="line"><a name="l00983"></a><span class="lineno">  983</span>&#160;}</div>
<div class="line"><a name="l00984"></a><span class="lineno">  984</span>&#160;</div>
<div class="line"><a name="l00985"></a><span class="lineno">  985</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00986"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a8d98a5cf4daaa5afb9a7a17b2980898a">  986</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a8d98a5cf4daaa5afb9a7a17b2980898a" title="Change the value to the specified bit to 0.">ArrayvEBTree&lt;T&gt;::toComplInLevel</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l00987"></a><span class="lineno">  987</span>&#160;        <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[<a class="code" href="classArrayvEBTree.html#ac247e12955c43513e74f562154043acb" title="The index of the specified element in the vector of words.">wordIdx</a>(i)] &amp;= ~(1LL &lt;&lt; (<a class="code" href="classArrayvEBTree.html#a411ea5691e2e29fa27558da575bbc04b" title="The index of the specified element in a word.">inWordIdx</a>(i)));</div>
<div class="line"><a name="l00988"></a><span class="lineno">  988</span>&#160;}</div>
<div class="line"><a name="l00989"></a><span class="lineno">  989</span>&#160;</div>
<div class="line"><a name="l00990"></a><span class="lineno">  990</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l00991"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0">  991</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">ArrayvEBTree&lt;T&gt;::toSet</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l00992"></a><span class="lineno">  992</span>&#160;        <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[<a class="code" href="classArrayvEBTree.html#ac247e12955c43513e74f562154043acb" title="The index of the specified element in the vector of words.">wordIdx</a>(i)] |= (1LL &lt;&lt; (<a class="code" href="classArrayvEBTree.html#a411ea5691e2e29fa27558da575bbc04b" title="The index of the specified element in a word.">inWordIdx</a>(i)));</div>
<div class="line"><a name="l00993"></a><span class="lineno">  993</span>&#160;        <span class="keywordtype">int</span> j = 1,index = <a class="code" href="classArrayvEBTree.html#ac247e12955c43513e74f562154043acb" title="The index of the specified element in the vector of words.">wordIdx</a>(i);</div>
<div class="line"><a name="l00994"></a><span class="lineno">  994</span>&#160;</div>
<div class="line"><a name="l00995"></a><span class="lineno">  995</span>&#160;        <span class="comment">//update the summary vector if necessary</span></div>
<div class="line"><a name="l00996"></a><span class="lineno">  996</span>&#160;        <span class="keywordflow">while</span>(j &lt; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> &amp;&amp; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[j]-&gt;<a class="code" href="classArrayvEBTree.html#afb7667e1adb8e7aa75a4922d7c2527cb" title="Determines whether the specified element is in this complement.">isInCompl</a>(index)){</div>
<div class="line"><a name="l00997"></a><span class="lineno">  997</span>&#160;                <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[j]-&gt;toSetInLevel(index);</div>
<div class="line"><a name="l00998"></a><span class="lineno">  998</span>&#160;                index = <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[j]-&gt;wordIdx(index);</div>
<div class="line"><a name="l00999"></a><span class="lineno">  999</span>&#160;                j++;</div>
<div class="line"><a name="l01000"></a><span class="lineno"> 1000</span>&#160;        }</div>
<div class="line"><a name="l01001"></a><span class="lineno"> 1001</span>&#160;}</div>
<div class="line"><a name="l01002"></a><span class="lineno"> 1002</span>&#160;</div>
<div class="line"><a name="l01003"></a><span class="lineno"> 1003</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01004"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4"> 1004</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">ArrayvEBTree&lt;T&gt;::toCompl</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l01005"></a><span class="lineno"> 1005</span>&#160;        <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[<a class="code" href="classArrayvEBTree.html#ac247e12955c43513e74f562154043acb" title="The index of the specified element in the vector of words.">wordIdx</a>(i)] &amp;= ~(1LL &lt;&lt; (<a class="code" href="classArrayvEBTree.html#a411ea5691e2e29fa27558da575bbc04b" title="The index of the specified element in a word.">inWordIdx</a>(i)));</div>
<div class="line"><a name="l01006"></a><span class="lineno"> 1006</span>&#160;        <span class="keywordtype">int</span> j = 1,index = <a class="code" href="classArrayvEBTree.html#ac247e12955c43513e74f562154043acb" title="The index of the specified element in the vector of words.">wordIdx</a>(i);</div>
<div class="line"><a name="l01007"></a><span class="lineno"> 1007</span>&#160;        T word = 0;</div>
<div class="line"><a name="l01008"></a><span class="lineno"> 1008</span>&#160;</div>
<div class="line"><a name="l01009"></a><span class="lineno"> 1009</span>&#160;        <span class="comment">//update the summary vector if necessary</span></div>
<div class="line"><a name="l01010"></a><span class="lineno"> 1010</span>&#160;        <span class="keywordflow">while</span>(word == 0 &amp;&amp; j &lt; <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a>){</div>
<div class="line"><a name="l01011"></a><span class="lineno"> 1011</span>&#160;                <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[j]-&gt;toComplInLevel(index);</div>
<div class="line"><a name="l01012"></a><span class="lineno"> 1012</span>&#160;                word = <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[j]-&gt;treeNode(index);</div>
<div class="line"><a name="l01013"></a><span class="lineno"> 1013</span>&#160;                index = <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[j]-&gt;wordIdx(index);</div>
<div class="line"><a name="l01014"></a><span class="lineno"> 1014</span>&#160;                j++;</div>
<div class="line"><a name="l01015"></a><span class="lineno"> 1015</span>&#160;        }</div>
<div class="line"><a name="l01016"></a><span class="lineno"> 1016</span>&#160;}</div>
<div class="line"><a name="l01017"></a><span class="lineno"> 1017</span>&#160;</div>
<div class="line"><a name="l01018"></a><span class="lineno"> 1018</span>&#160;</div>
<div class="line"><a name="l01019"></a><span class="lineno"> 1019</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01020"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#ab104347ec00cdf4621bf227354cda97c"> 1020</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classArrayvEBTree.html#ab104347ec00cdf4621bf227354cda97c" title="Determines whether the specified element is in this set.">ArrayvEBTree&lt;T&gt;::isInSet</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l01021"></a><span class="lineno"> 1021</span>&#160;        <span class="keywordflow">return</span> (<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[<a class="code" href="classArrayvEBTree.html#ac247e12955c43513e74f562154043acb" title="The index of the specified element in the vector of words.">wordIdx</a>(i)] &amp; (1LL &lt;&lt; (<a class="code" href="classArrayvEBTree.html#a411ea5691e2e29fa27558da575bbc04b" title="The index of the specified element in a word.">inWordIdx</a>(i)))) != 0;</div>
<div class="line"><a name="l01022"></a><span class="lineno"> 1022</span>&#160;}</div>
<div class="line"><a name="l01023"></a><span class="lineno"> 1023</span>&#160;</div>
<div class="line"><a name="l01024"></a><span class="lineno"> 1024</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01025"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#afb7667e1adb8e7aa75a4922d7c2527cb"> 1025</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classArrayvEBTree.html#afb7667e1adb8e7aa75a4922d7c2527cb" title="Determines whether the specified element is in this complement.">ArrayvEBTree&lt;T&gt;::isInCompl</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l01026"></a><span class="lineno"> 1026</span>&#160;        <span class="keywordflow">return</span> (<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[<a class="code" href="classArrayvEBTree.html#ac247e12955c43513e74f562154043acb" title="The index of the specified element in the vector of words.">wordIdx</a>(i)] &amp; (1LL &lt;&lt; (<a class="code" href="classArrayvEBTree.html#a411ea5691e2e29fa27558da575bbc04b" title="The index of the specified element in a word.">inWordIdx</a>(i)))) == 0;</div>
<div class="line"><a name="l01027"></a><span class="lineno"> 1027</span>&#160;}</div>
<div class="line"><a name="l01028"></a><span class="lineno"> 1028</span>&#160;</div>
<div class="line"><a name="l01029"></a><span class="lineno"> 1029</span>&#160;</div>
<div class="line"><a name="l01030"></a><span class="lineno"> 1030</span>&#160;<span class="keyword">template</span>&lt;&gt;</div>
<div class="line"><a name="l01031"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#afe36227a48fd554a606789ecfa940cb1"> 1031</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#a184eea043a0703a3541723253b4eae28" title="Determine the first bit 1 after the i-th bit in the word that the i-th bit belongs.">ArrayvEBTree&lt;int&gt;::nextSetInWord</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l01032"></a><span class="lineno"> 1032</span>&#160;        <span class="comment">//using builtin to look inside a word</span></div>
<div class="line"><a name="l01033"></a><span class="lineno"> 1033</span>&#160;        <span class="keywordflow">return</span> builtinLeast&lt;int&gt;(<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[<a class="code" href="classArrayvEBTree.html#ac247e12955c43513e74f562154043acb" title="The index of the specified element in the vector of words.">wordIdx</a>(i)] &amp; <a class="code" href="classBitTools.html#a282ef6cebdba59e5ca064290ec898d10">posmasksimp</a>[<a class="code" href="classArrayvEBTree.html#a411ea5691e2e29fa27558da575bbc04b" title="The index of the specified element in a word.">inWordIdx</a>(i)]);</div>
<div class="line"><a name="l01034"></a><span class="lineno"> 1034</span>&#160;}</div>
<div class="line"><a name="l01035"></a><span class="lineno"> 1035</span>&#160;</div>
<div class="line"><a name="l01036"></a><span class="lineno"> 1036</span>&#160;<span class="keyword">template</span>&lt;&gt;</div>
<div class="line"><a name="l01037"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#aeaed7f8b89d19594e2f39338573cb2f6"> 1037</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#a184eea043a0703a3541723253b4eae28" title="Determine the first bit 1 after the i-th bit in the word that the i-th bit belongs.">ArrayvEBTree&lt;long&gt;::nextSetInWord</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l01038"></a><span class="lineno"> 1038</span>&#160;        <span class="comment">//using builtin to look inside a word</span></div>
<div class="line"><a name="l01039"></a><span class="lineno"> 1039</span>&#160;        <span class="keywordflow">return</span> builtinLeast&lt;long&gt;(<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[<a class="code" href="classArrayvEBTree.html#ac247e12955c43513e74f562154043acb" title="The index of the specified element in the vector of words.">wordIdx</a>(i)] &amp; <a class="code" href="classBitTools.html#a282ef6cebdba59e5ca064290ec898d10">posmasksimp</a>[<a class="code" href="classArrayvEBTree.html#a411ea5691e2e29fa27558da575bbc04b" title="The index of the specified element in a word.">inWordIdx</a>(i)]);</div>
<div class="line"><a name="l01040"></a><span class="lineno"> 1040</span>&#160;}</div>
<div class="line"><a name="l01041"></a><span class="lineno"> 1041</span>&#160;</div>
<div class="line"><a name="l01042"></a><span class="lineno"> 1042</span>&#160;<span class="keyword">template</span>&lt;&gt;</div>
<div class="line"><a name="l01043"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a3ed0112ecaa2843407ccb899182505b1"> 1043</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#ac18a863eee6d54232ffb651ee5ddcf6c" title="Determine the first bit 1 in the array of words.">ArrayvEBTree&lt;int&gt;::firstSetInWord</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l01044"></a><span class="lineno"> 1044</span>&#160;        <span class="comment">//using builtin to look inside a word</span></div>
<div class="line"><a name="l01045"></a><span class="lineno"> 1045</span>&#160;        <span class="keywordflow">return</span> builtinLeast&lt;int&gt;(<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[i]) ;</div>
<div class="line"><a name="l01046"></a><span class="lineno"> 1046</span>&#160;}</div>
<div class="line"><a name="l01047"></a><span class="lineno"> 1047</span>&#160;</div>
<div class="line"><a name="l01048"></a><span class="lineno"> 1048</span>&#160;<span class="keyword">template</span>&lt;&gt;</div>
<div class="line"><a name="l01049"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#abf0a0b9633f3224acd97556182a91515"> 1049</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#ac18a863eee6d54232ffb651ee5ddcf6c" title="Determine the first bit 1 in the array of words.">ArrayvEBTree&lt;long&gt;::firstSetInWord</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l01050"></a><span class="lineno"> 1050</span>&#160;        <span class="comment">//using builtin to look inside a word</span></div>
<div class="line"><a name="l01051"></a><span class="lineno"> 1051</span>&#160;        <span class="keywordflow">return</span> builtinLeast&lt;long&gt;(<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[i]) ;</div>
<div class="line"><a name="l01052"></a><span class="lineno"> 1052</span>&#160;}</div>
<div class="line"><a name="l01053"></a><span class="lineno"> 1053</span>&#160;</div>
<div class="line"><a name="l01054"></a><span class="lineno"> 1054</span>&#160;<span class="keyword">template</span>&lt;&gt;</div>
<div class="line"><a name="l01055"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#aab6518e3cae4c519dc881bc9f3ebf230"> 1055</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#aa7dba9c3fa002463ea492182f4b6fa9d" title="Determine the first bit 0 in the array of words.">ArrayvEBTree&lt;int&gt;::firstComplInWord</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l01056"></a><span class="lineno"> 1056</span>&#160;        <span class="comment">//using builtin to look inside a word</span></div>
<div class="line"><a name="l01057"></a><span class="lineno"> 1057</span>&#160;        <span class="keywordflow">return</span> builtinLeast&lt;int&gt;(~<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[i]) ;</div>
<div class="line"><a name="l01058"></a><span class="lineno"> 1058</span>&#160;}</div>
<div class="line"><a name="l01059"></a><span class="lineno"> 1059</span>&#160;</div>
<div class="line"><a name="l01060"></a><span class="lineno"> 1060</span>&#160;<span class="keyword">template</span>&lt;&gt;</div>
<div class="line"><a name="l01061"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a76b34432774f4b07f8a7f5c0b0e5d225"> 1061</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#aa7dba9c3fa002463ea492182f4b6fa9d" title="Determine the first bit 0 in the array of words.">ArrayvEBTree&lt;long&gt;::firstComplInWord</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l01062"></a><span class="lineno"> 1062</span>&#160;        <span class="comment">//using builtin to look inside a word</span></div>
<div class="line"><a name="l01063"></a><span class="lineno"> 1063</span>&#160;        <span class="keywordflow">return</span> builtinLeast&lt;long&gt;(~<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[i]) ;</div>
<div class="line"><a name="l01064"></a><span class="lineno"> 1064</span>&#160;}</div>
<div class="line"><a name="l01065"></a><span class="lineno"> 1065</span>&#160;</div>
<div class="line"><a name="l01066"></a><span class="lineno"> 1066</span>&#160;<span class="keyword">template</span>&lt;&gt;</div>
<div class="line"><a name="l01067"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a1aa1d1381e452b48661361ea51e265b6"> 1067</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#a7121c7f03b562468afd4d95cc3d422ab" title="Determine the first bit 0 after the i-th bit in the word that the i-th bit belongs.">ArrayvEBTree&lt;int&gt;::nextComplInWord</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l01068"></a><span class="lineno"> 1068</span>&#160;        <span class="comment">//using builtin to look inside a word</span></div>
<div class="line"><a name="l01069"></a><span class="lineno"> 1069</span>&#160;        <span class="keywordflow">return</span> builtinLeast&lt;int&gt;((~<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[<a class="code" href="classArrayvEBTree.html#ac247e12955c43513e74f562154043acb" title="The index of the specified element in the vector of words.">wordIdx</a>(i)]) &amp; <a class="code" href="classBitTools.html#a282ef6cebdba59e5ca064290ec898d10">posmasksimp</a>[<a class="code" href="classArrayvEBTree.html#a411ea5691e2e29fa27558da575bbc04b" title="The index of the specified element in a word.">inWordIdx</a>(i)]);</div>
<div class="line"><a name="l01070"></a><span class="lineno"> 1070</span>&#160;}</div>
<div class="line"><a name="l01071"></a><span class="lineno"> 1071</span>&#160;</div>
<div class="line"><a name="l01072"></a><span class="lineno"> 1072</span>&#160;<span class="keyword">template</span>&lt;&gt;</div>
<div class="line"><a name="l01073"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#aaf0de16756027298d7a97f9a800b9461"> 1073</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#a7121c7f03b562468afd4d95cc3d422ab" title="Determine the first bit 0 after the i-th bit in the word that the i-th bit belongs.">ArrayvEBTree&lt;long&gt;::nextComplInWord</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l01074"></a><span class="lineno"> 1074</span>&#160;        <span class="comment">//using builtin to look inside a word</span></div>
<div class="line"><a name="l01075"></a><span class="lineno"> 1075</span>&#160;        <span class="keywordflow">return</span> builtinLeast&lt;long&gt;((~<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[<a class="code" href="classArrayvEBTree.html#ac247e12955c43513e74f562154043acb" title="The index of the specified element in the vector of words.">wordIdx</a>(i)]) &amp; <a class="code" href="classBitTools.html#a282ef6cebdba59e5ca064290ec898d10">posmasksimp</a>[<a class="code" href="classArrayvEBTree.html#a411ea5691e2e29fa27558da575bbc04b" title="The index of the specified element in a word.">inWordIdx</a>(i)]);</div>
<div class="line"><a name="l01076"></a><span class="lineno"> 1076</span>&#160;}</div>
<div class="line"><a name="l01077"></a><span class="lineno"> 1077</span>&#160;</div>
<div class="line"><a name="l01078"></a><span class="lineno"> 1078</span>&#160;</div>
<div class="line"><a name="l01079"></a><span class="lineno"> 1079</span>&#160;<span class="keyword">template</span>&lt;&gt;</div>
<div class="line"><a name="l01080"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#acab779b781b9b25860524cfb10feb23e"> 1080</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#ac6cd27e6be3b63549c4369cc452f8ea3" title="Count the number of bits 1 in the specified word.">ArrayvEBTree&lt;int&gt;::countSetInWord</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l01081"></a><span class="lineno"> 1081</span>&#160;        <span class="comment">//using builtin to count</span></div>
<div class="line"><a name="l01082"></a><span class="lineno"> 1082</span>&#160;        <span class="keywordflow">return</span> builtinCounter&lt;int&gt;(<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[i]);</div>
<div class="line"><a name="l01083"></a><span class="lineno"> 1083</span>&#160;}</div>
<div class="line"><a name="l01084"></a><span class="lineno"> 1084</span>&#160;</div>
<div class="line"><a name="l01085"></a><span class="lineno"> 1085</span>&#160;<span class="keyword">template</span>&lt;&gt;</div>
<div class="line"><a name="l01086"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a3a4b916a7c3f4d82eae8399163c68b95"> 1086</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#ac6cd27e6be3b63549c4369cc452f8ea3" title="Count the number of bits 1 in the specified word.">ArrayvEBTree&lt;long&gt;::countSetInWord</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l01087"></a><span class="lineno"> 1087</span>&#160;        <span class="comment">//using builtin to count</span></div>
<div class="line"><a name="l01088"></a><span class="lineno"> 1088</span>&#160;        <span class="keywordflow">return</span> builtinCounter&lt;long&gt;(<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[i]);</div>
<div class="line"><a name="l01089"></a><span class="lineno"> 1089</span>&#160;}</div>
<div class="line"><a name="l01090"></a><span class="lineno"> 1090</span>&#160;</div>
<div class="line"><a name="l01091"></a><span class="lineno"> 1091</span>&#160;<span class="keyword">template</span>&lt;&gt;</div>
<div class="line"><a name="l01092"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#ab895428cacb6aa95e4113ab3fa605053"> 1092</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#a37708562d2996f6b302b1304c558ae9e" title="Count the number of bits 0 in the specified word.">ArrayvEBTree&lt;int&gt;::countComplInWord</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l01093"></a><span class="lineno"> 1093</span>&#160;        <span class="comment">//using builtin to count</span></div>
<div class="line"><a name="l01094"></a><span class="lineno"> 1094</span>&#160;        <span class="keywordflow">return</span> builtinCounter&lt;int&gt;(~<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[i]);</div>
<div class="line"><a name="l01095"></a><span class="lineno"> 1095</span>&#160;}</div>
<div class="line"><a name="l01096"></a><span class="lineno"> 1096</span>&#160;</div>
<div class="line"><a name="l01097"></a><span class="lineno"> 1097</span>&#160;<span class="keyword">template</span>&lt;&gt;</div>
<div class="line"><a name="l01098"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a31afcb422ca60063dc27f70045cdaafa"> 1098</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#a37708562d2996f6b302b1304c558ae9e" title="Count the number of bits 0 in the specified word.">ArrayvEBTree&lt;long&gt;::countComplInWord</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l01099"></a><span class="lineno"> 1099</span>&#160;        <span class="comment">//using builtin to count</span></div>
<div class="line"><a name="l01100"></a><span class="lineno"> 1100</span>&#160;        <span class="keywordflow">return</span> builtinCounter&lt;long&gt;(~<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[i]);</div>
<div class="line"><a name="l01101"></a><span class="lineno"> 1101</span>&#160;}</div>
<div class="line"><a name="l01102"></a><span class="lineno"> 1102</span>&#160;</div>
<div class="line"><a name="l01103"></a><span class="lineno"> 1103</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01104"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a635cb741c5aeffa93ae513a06a9d2e12"> 1104</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classArrayvEBTree.html#a635cb741c5aeffa93ae513a06a9d2e12" title="Change the value of the i-th word in the array of words.">ArrayvEBTree&lt;T&gt;::setNode</a>(<span class="keywordtype">long</span> i, T newnode){</div>
<div class="line"><a name="l01105"></a><span class="lineno"> 1105</span>&#160;        <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[i] = newnode;</div>
<div class="line"><a name="l01106"></a><span class="lineno"> 1106</span>&#160;</div>
<div class="line"><a name="l01107"></a><span class="lineno"> 1107</span>&#160;        <span class="comment">//if has a upper vector, update it</span></div>
<div class="line"><a name="l01108"></a><span class="lineno"> 1108</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> &gt; 1){</div>
<div class="line"><a name="l01109"></a><span class="lineno"> 1109</span>&#160;                <span class="keywordflow">if</span>(newnode == 0)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[1]-&gt;<a class="code" href="classMultiLevelDirectlyAddressedSet.html#a89ddde96a5d56c4d93ad2e3815dfd71a" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01110"></a><span class="lineno"> 1110</span>&#160;                <span class="keywordflow">else</span> <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[1]-&gt;<a class="code" href="classMultiLevelDirectlyAddressedSet.html#aaede99bafd9582b3d4e51ea50e7e6149" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01111"></a><span class="lineno"> 1111</span>&#160;        }</div>
<div class="line"><a name="l01112"></a><span class="lineno"> 1112</span>&#160;        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l01113"></a><span class="lineno"> 1113</span>&#160;}</div>
<div class="line"><a name="l01114"></a><span class="lineno"> 1114</span>&#160;</div>
<div class="line"><a name="l01115"></a><span class="lineno"> 1115</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01116"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#add0dd37dfa5047674dc9efdfa60f48e9"> 1116</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classArrayvEBTree.html#add0dd37dfa5047674dc9efdfa60f48e9" title="Change the value of the i-th word in the array of words without update any information in the other l...">ArrayvEBTree&lt;T&gt;::setNodeInLevel</a>(<span class="keywordtype">long</span> i, T newnode){</div>
<div class="line"><a name="l01117"></a><span class="lineno"> 1117</span>&#160;        <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[i] = newnode;</div>
<div class="line"><a name="l01118"></a><span class="lineno"> 1118</span>&#160;        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l01119"></a><span class="lineno"> 1119</span>&#160;}</div>
<div class="line"><a name="l01120"></a><span class="lineno"> 1120</span>&#160;</div>
<div class="line"><a name="l01121"></a><span class="lineno"> 1121</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01122"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a29b99e86ee4bbfc2dc35470ee8b563f1"> 1122</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span>* <a class="code" href="classArrayvEBTree.html#a29b99e86ee4bbfc2dc35470ee8b563f1" title="Returns an array containing all of the elements in this set in increasing order.">ArrayvEBTree&lt;T&gt;::toArray</a>(<span class="keywordtype">long</span>* <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>){</div>
<div class="line"><a name="l01123"></a><span class="lineno"> 1123</span>&#160;        <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::bitvector</a> = <span class="keyword">new</span> <span class="keywordtype">long</span>[<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>];</div>
<div class="line"><a name="l01124"></a><span class="lineno"> 1124</span>&#160;        <span class="keywordflow">for</span>(*size = 0; *size &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; (*size)++){</div>
<div class="line"><a name="l01125"></a><span class="lineno"> 1125</span>&#160;                <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::bitvector</a>[*<a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>] = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>[*<a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>];</div>
<div class="line"><a name="l01126"></a><span class="lineno"> 1126</span>&#160;        }</div>
<div class="line"><a name="l01127"></a><span class="lineno"> 1127</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::bitvector</a>;</div>
<div class="line"><a name="l01128"></a><span class="lineno"> 1128</span>&#160;}</div>
<div class="line"><a name="l01129"></a><span class="lineno"> 1129</span>&#160;</div>
<div class="line"><a name="l01130"></a><span class="lineno"> 1130</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01131"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf"> 1131</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">ArrayvEBTree&lt;T&gt;::size</a>(){</div>
<div class="line"><a name="l01132"></a><span class="lineno"> 1132</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::n</a>;</div>
<div class="line"><a name="l01133"></a><span class="lineno"> 1133</span>&#160;}</div>
<div class="line"><a name="l01134"></a><span class="lineno"> 1134</span>&#160;</div>
<div class="line"><a name="l01135"></a><span class="lineno"> 1135</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01136"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a997e188999c994a537e22eb7cc801d1b"> 1136</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#a997e188999c994a537e22eb7cc801d1b" title="The size of the vector of words.">ArrayvEBTree&lt;T&gt;::sizeInWord</a>(){</div>
<div class="line"><a name="l01137"></a><span class="lineno"> 1137</span>&#160;        <span class="keywordflow">return</span> <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01138"></a><span class="lineno"> 1138</span>&#160;}</div>
<div class="line"><a name="l01139"></a><span class="lineno"> 1139</span>&#160;</div>
<div class="line"><a name="l01140"></a><span class="lineno"> 1140</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01141"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a7d2a262570ed4a0cca9c7b26a93c27a3"> 1141</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a7d2a262570ed4a0cca9c7b26a93c27a3" title="Change the value of all bits to 1.">ArrayvEBTree&lt;T&gt;::allToSetInLevel</a>(){</div>
<div class="line"><a name="l01142"></a><span class="lineno"> 1142</span>&#160;        memset(<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>, 255, <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>*<span class="keyword">sizeof</span>(T));</div>
<div class="line"><a name="l01143"></a><span class="lineno"> 1143</span>&#160;}</div>
<div class="line"><a name="l01144"></a><span class="lineno"> 1144</span>&#160;</div>
<div class="line"><a name="l01145"></a><span class="lineno"> 1145</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01146"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a23abf9f3e7cd4b36454240d3dfb2001d"> 1146</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a23abf9f3e7cd4b36454240d3dfb2001d" title="Add all the elements of the universe to the set.">ArrayvEBTree&lt;T&gt;::allToSet</a>(){</div>
<div class="line"><a name="l01147"></a><span class="lineno"> 1147</span>&#160;        memset(<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>, 255, <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>*<span class="keyword">sizeof</span>(T));</div>
<div class="line"><a name="l01148"></a><span class="lineno"> 1148</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 1; i &lt; MultiLevelDirectlyAddressedSet&lt;T&gt;::height; i++){</div>
<div class="line"><a name="l01149"></a><span class="lineno"> 1149</span>&#160;                <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[i]-&gt;allToSetInLevel();</div>
<div class="line"><a name="l01150"></a><span class="lineno"> 1150</span>&#160;        }</div>
<div class="line"><a name="l01151"></a><span class="lineno"> 1151</span>&#160;}</div>
<div class="line"><a name="l01152"></a><span class="lineno"> 1152</span>&#160;</div>
<div class="line"><a name="l01153"></a><span class="lineno"> 1153</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01154"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#ae4908c05f6c6ea3f9bc2600148ea243b"> 1154</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#ae4908c05f6c6ea3f9bc2600148ea243b" title="Change the value of all bits to 0.">ArrayvEBTree&lt;T&gt;::allToComplInLevel</a>(){</div>
<div class="line"><a name="l01155"></a><span class="lineno"> 1155</span>&#160;        memset(<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>, 0, <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>*<span class="keyword">sizeof</span>(T));</div>
<div class="line"><a name="l01156"></a><span class="lineno"> 1156</span>&#160;}</div>
<div class="line"><a name="l01157"></a><span class="lineno"> 1157</span>&#160;</div>
<div class="line"><a name="l01158"></a><span class="lineno"> 1158</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01159"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a77964dcd987649572435fbc1847e28ba"> 1159</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a77964dcd987649572435fbc1847e28ba" title="Add all the elements of the universe to the complement.">ArrayvEBTree&lt;T&gt;::allToCompl</a>(){</div>
<div class="line"><a name="l01160"></a><span class="lineno"> 1160</span>&#160;        memset(<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>, 0, <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>*<span class="keyword">sizeof</span>(T));</div>
<div class="line"><a name="l01161"></a><span class="lineno"> 1161</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 1; i &lt; MultiLevelDirectlyAddressedSet&lt;T&gt;::height; i++){</div>
<div class="line"><a name="l01162"></a><span class="lineno"> 1162</span>&#160;                <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[i]-&gt;allToComplInLevel();</div>
<div class="line"><a name="l01163"></a><span class="lineno"> 1163</span>&#160;        }</div>
<div class="line"><a name="l01164"></a><span class="lineno"> 1164</span>&#160;}</div>
<div class="line"><a name="l01165"></a><span class="lineno"> 1165</span>&#160;</div>
<div class="line"><a name="l01166"></a><span class="lineno"> 1166</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01167"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#ac586f1424b6fc9b0049ab5d196d056bf"> 1167</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#ac586f1424b6fc9b0049ab5d196d056bf" title="The operation of union between the set represented by this object and the set represented by v...">ArrayvEBTree&lt;T&gt;::setUnionSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v){</div>
<div class="line"><a name="l01168"></a><span class="lineno"> 1168</span>&#160;        <span class="keywordtype">long</span> ht = <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a>;</div>
<div class="line"><a name="l01169"></a><span class="lineno"> 1169</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>;</div>
<div class="line"><a name="l01170"></a><span class="lineno"> 1170</span>&#160;        <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a>;</div>
<div class="line"><a name="l01171"></a><span class="lineno"> 1171</span>&#160;        T* avec;</div>
<div class="line"><a name="l01172"></a><span class="lineno"> 1172</span>&#160;        T* bvec;</div>
<div class="line"><a name="l01173"></a><span class="lineno"> 1173</span>&#160;        T* lim;</div>
<div class="line"><a name="l01174"></a><span class="lineno"> 1174</span>&#160;</div>
<div class="line"><a name="l01175"></a><span class="lineno"> 1175</span>&#160;        avec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[ht-1])-&gt;vector;</div>
<div class="line"><a name="l01176"></a><span class="lineno"> 1176</span>&#160;        bvec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)(v-&gt;vEBTree&lt;T&gt;::levels[ht-1]))-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01177"></a><span class="lineno"> 1177</span>&#160;        lim = avec + ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[ht-1])-&gt;vectorsz;</div>
<div class="line"><a name="l01178"></a><span class="lineno"> 1178</span>&#160;        <span class="keywordflow">for</span>(; avec &lt; lim; avec++ , bvec ++) *avec |= *bvec;</div>
<div class="line"><a name="l01179"></a><span class="lineno"> 1179</span>&#160;</div>
<div class="line"><a name="l01180"></a><span class="lineno"> 1180</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = ht-2; i &gt;= 0; i--){</div>
<div class="line"><a name="l01181"></a><span class="lineno"> 1181</span>&#160;                up = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[i+1]);</div>
<div class="line"><a name="l01182"></a><span class="lineno"> 1182</span>&#160;                bvec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)v-&gt;vEBTree&lt;T&gt;::levels[i])-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01183"></a><span class="lineno"> 1183</span>&#160;                avec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[i])-&gt;vector;</div>
<div class="line"><a name="l01184"></a><span class="lineno"> 1184</span>&#160;                size = up-&gt;<a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>();</div>
<div class="line"><a name="l01185"></a><span class="lineno"> 1185</span>&#160;                <span class="keywordtype">long</span> j = up-&gt;<a class="code" href="classArrayvEBTree.html#a6036c4756a28f364f661dc0d50646eb4" title="Determine the next element in the set of the specified element.">nextSetElement</a>(0);</div>
<div class="line"><a name="l01186"></a><span class="lineno"> 1186</span>&#160;                <span class="keywordflow">while</span>(j &lt; size-1){</div>
<div class="line"><a name="l01187"></a><span class="lineno"> 1187</span>&#160;                        avec[j] |= bvec[j];</div>
<div class="line"><a name="l01188"></a><span class="lineno"> 1188</span>&#160;                        j = up-&gt;<a class="code" href="classArrayvEBTree.html#a6036c4756a28f364f661dc0d50646eb4" title="Determine the next element in the set of the specified element.">nextSetElement</a>(j+1);</div>
<div class="line"><a name="l01189"></a><span class="lineno"> 1189</span>&#160;                }</div>
<div class="line"><a name="l01190"></a><span class="lineno"> 1190</span>&#160;                avec[size-1] |= bvec[size-1];</div>
<div class="line"><a name="l01191"></a><span class="lineno"> 1191</span>&#160;        }</div>
<div class="line"><a name="l01192"></a><span class="lineno"> 1192</span>&#160;}</div>
<div class="line"><a name="l01193"></a><span class="lineno"> 1193</span>&#160;</div>
<div class="line"><a name="l01194"></a><span class="lineno"> 1194</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01195"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#abce9af9d332451bd3f7f012903883f99"> 1195</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#ac586f1424b6fc9b0049ab5d196d056bf" title="The operation of union between the set represented by this object and the set represented by v...">ArrayvEBTree&lt;T&gt;::setUnionSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* ret){</div>
<div class="line"><a name="l01196"></a><span class="lineno"> 1196</span>&#160;        <span class="keywordtype">long</span> ht = <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a>;</div>
<div class="line"><a name="l01197"></a><span class="lineno"> 1197</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>;</div>
<div class="line"><a name="l01198"></a><span class="lineno"> 1198</span>&#160;        <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a>;</div>
<div class="line"><a name="l01199"></a><span class="lineno"> 1199</span>&#160;        T* avec;</div>
<div class="line"><a name="l01200"></a><span class="lineno"> 1200</span>&#160;        T* bvec;</div>
<div class="line"><a name="l01201"></a><span class="lineno"> 1201</span>&#160;        T* cvec;</div>
<div class="line"><a name="l01202"></a><span class="lineno"> 1202</span>&#160;        T* lim;</div>
<div class="line"><a name="l01203"></a><span class="lineno"> 1203</span>&#160;</div>
<div class="line"><a name="l01204"></a><span class="lineno"> 1204</span>&#160;        avec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[ht-1])-&gt;vector;</div>
<div class="line"><a name="l01205"></a><span class="lineno"> 1205</span>&#160;        bvec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)(v-&gt;vEBTree&lt;T&gt;::levels[ht-1]))-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01206"></a><span class="lineno"> 1206</span>&#160;        cvec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)(ret-&gt;vEBTree&lt;T&gt;::levels[ht-1]))-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01207"></a><span class="lineno"> 1207</span>&#160;        lim = avec + ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[ht-1])-&gt;vectorsz;</div>
<div class="line"><a name="l01208"></a><span class="lineno"> 1208</span>&#160;        <span class="keywordflow">for</span>(; avec &lt; lim; avec++ , bvec++, cvec++) *cvec = *avec | *bvec;</div>
<div class="line"><a name="l01209"></a><span class="lineno"> 1209</span>&#160;</div>
<div class="line"><a name="l01210"></a><span class="lineno"> 1210</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = ht-2; i &gt;= 0; i--){</div>
<div class="line"><a name="l01211"></a><span class="lineno"> 1211</span>&#160;                up = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)ret-&gt;vEBTree&lt;T&gt;::levels[i+1]);</div>
<div class="line"><a name="l01212"></a><span class="lineno"> 1212</span>&#160;                bvec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)v-&gt;vEBTree&lt;T&gt;::levels[i])-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01213"></a><span class="lineno"> 1213</span>&#160;                avec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[i])-&gt;vector;</div>
<div class="line"><a name="l01214"></a><span class="lineno"> 1214</span>&#160;                cvec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)ret-&gt;vEBTree&lt;T&gt;::levels[i])-&gt;vector;</div>
<div class="line"><a name="l01215"></a><span class="lineno"> 1215</span>&#160;                size = up-&gt;<a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>();</div>
<div class="line"><a name="l01216"></a><span class="lineno"> 1216</span>&#160;                <span class="keywordtype">long</span> j = up-&gt;<a class="code" href="classArrayvEBTree.html#a6036c4756a28f364f661dc0d50646eb4" title="Determine the next element in the set of the specified element.">nextSetElement</a>(0);</div>
<div class="line"><a name="l01217"></a><span class="lineno"> 1217</span>&#160;                <span class="keywordflow">while</span>(j &lt; size-1){</div>
<div class="line"><a name="l01218"></a><span class="lineno"> 1218</span>&#160;                        cvec[j] = avec[j] | bvec[j];</div>
<div class="line"><a name="l01219"></a><span class="lineno"> 1219</span>&#160;                        j = up-&gt;<a class="code" href="classArrayvEBTree.html#a6036c4756a28f364f661dc0d50646eb4" title="Determine the next element in the set of the specified element.">nextSetElement</a>(j+1);</div>
<div class="line"><a name="l01220"></a><span class="lineno"> 1220</span>&#160;                }</div>
<div class="line"><a name="l01221"></a><span class="lineno"> 1221</span>&#160;                cvec[size-1] = avec[size-1] | bvec[size-1];</div>
<div class="line"><a name="l01222"></a><span class="lineno"> 1222</span>&#160;        }</div>
<div class="line"><a name="l01223"></a><span class="lineno"> 1223</span>&#160;}</div>
<div class="line"><a name="l01224"></a><span class="lineno"> 1224</span>&#160;</div>
<div class="line"><a name="l01225"></a><span class="lineno"> 1225</span>&#160;</div>
<div class="line"><a name="l01226"></a><span class="lineno"> 1226</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01227"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#aa8b2fb704a39091782e70abe6843f04f"> 1227</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#aa8b2fb704a39091782e70abe6843f04f" title="The operation of union between the set represented by this object and the set represented by v...">ArrayvEBTree&lt;T&gt;::setIntersecSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a> * v){</div>
<div class="line"><a name="l01228"></a><span class="lineno"> 1228</span>&#160;        <span class="keywordtype">long</span> ht = <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a>;</div>
<div class="line"><a name="l01229"></a><span class="lineno"> 1229</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>;</div>
<div class="line"><a name="l01230"></a><span class="lineno"> 1230</span>&#160;        <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a>;</div>
<div class="line"><a name="l01231"></a><span class="lineno"> 1231</span>&#160;        T* avec;</div>
<div class="line"><a name="l01232"></a><span class="lineno"> 1232</span>&#160;        T* bvec;</div>
<div class="line"><a name="l01233"></a><span class="lineno"> 1233</span>&#160;        T* lim;</div>
<div class="line"><a name="l01234"></a><span class="lineno"> 1234</span>&#160;</div>
<div class="line"><a name="l01235"></a><span class="lineno"> 1235</span>&#160;        avec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[ht-1])-&gt;vector;</div>
<div class="line"><a name="l01236"></a><span class="lineno"> 1236</span>&#160;        bvec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)v-&gt;vEBTree&lt;T&gt;::levels[ht-1])-&gt;vector;</div>
<div class="line"><a name="l01237"></a><span class="lineno"> 1237</span>&#160;        lim = avec + ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[ht-1])-&gt;vectorsz;</div>
<div class="line"><a name="l01238"></a><span class="lineno"> 1238</span>&#160;        <span class="keywordflow">for</span>(; avec &lt; lim; avec++ , bvec++) *avec &amp;= *bvec;</div>
<div class="line"><a name="l01239"></a><span class="lineno"> 1239</span>&#160;</div>
<div class="line"><a name="l01240"></a><span class="lineno"> 1240</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = ht-2; i &gt;= 0; i--){</div>
<div class="line"><a name="l01241"></a><span class="lineno"> 1241</span>&#160;                up = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[i+1]);</div>
<div class="line"><a name="l01242"></a><span class="lineno"> 1242</span>&#160;                bvec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)v-&gt;vEBTree&lt;T&gt;::levels[i])-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01243"></a><span class="lineno"> 1243</span>&#160;                avec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[i])-&gt;vector;</div>
<div class="line"><a name="l01244"></a><span class="lineno"> 1244</span>&#160;                size = up-&gt;<a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>();</div>
<div class="line"><a name="l01245"></a><span class="lineno"> 1245</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = up-&gt;<a class="code" href="classArrayvEBTree.html#a6036c4756a28f364f661dc0d50646eb4" title="Determine the next element in the set of the specified element.">nextSetElement</a>(0); j &lt; size-1; j = up-&gt;<a class="code" href="classArrayvEBTree.html#a6036c4756a28f364f661dc0d50646eb4" title="Determine the next element in the set of the specified element.">nextSetElement</a>(j+1)){</div>
<div class="line"><a name="l01246"></a><span class="lineno"> 1246</span>&#160;                        avec[j] &amp;= bvec[j];</div>
<div class="line"><a name="l01247"></a><span class="lineno"> 1247</span>&#160;                        <span class="keywordflow">if</span>(avec[j] == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a8d98a5cf4daaa5afb9a7a17b2980898a" title="Change the value to the specified bit to 0.">toComplInLevel</a>(j);</div>
<div class="line"><a name="l01248"></a><span class="lineno"> 1248</span>&#160;                }</div>
<div class="line"><a name="l01249"></a><span class="lineno"> 1249</span>&#160;                avec[size-1] &amp;= bvec[size-1];</div>
<div class="line"><a name="l01250"></a><span class="lineno"> 1250</span>&#160;        }</div>
<div class="line"><a name="l01251"></a><span class="lineno"> 1251</span>&#160;}</div>
<div class="line"><a name="l01252"></a><span class="lineno"> 1252</span>&#160;</div>
<div class="line"><a name="l01253"></a><span class="lineno"> 1253</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01254"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a9e37432573c8e711d828e7b53e40e4a2"> 1254</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#aa8b2fb704a39091782e70abe6843f04f" title="The operation of union between the set represented by this object and the set represented by v...">ArrayvEBTree&lt;T&gt;::setIntersecSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* ret){</div>
<div class="line"><a name="l01255"></a><span class="lineno"> 1255</span>&#160;        <span class="keywordtype">long</span> ht = <a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a>;</div>
<div class="line"><a name="l01256"></a><span class="lineno"> 1256</span>&#160;        <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>;</div>
<div class="line"><a name="l01257"></a><span class="lineno"> 1257</span>&#160;        <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a>;</div>
<div class="line"><a name="l01258"></a><span class="lineno"> 1258</span>&#160;        T* avec;</div>
<div class="line"><a name="l01259"></a><span class="lineno"> 1259</span>&#160;        T* bvec;</div>
<div class="line"><a name="l01260"></a><span class="lineno"> 1260</span>&#160;        T* cvec;</div>
<div class="line"><a name="l01261"></a><span class="lineno"> 1261</span>&#160;        T* lim;</div>
<div class="line"><a name="l01262"></a><span class="lineno"> 1262</span>&#160;</div>
<div class="line"><a name="l01263"></a><span class="lineno"> 1263</span>&#160;        avec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[ht-1])-&gt;vector;</div>
<div class="line"><a name="l01264"></a><span class="lineno"> 1264</span>&#160;        bvec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)v-&gt;vEBTree&lt;T&gt;::levels[ht-1])-&gt;vector;</div>
<div class="line"><a name="l01265"></a><span class="lineno"> 1265</span>&#160;        cvec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)ret-&gt;vEBTree&lt;T&gt;::levels[ht-1])-&gt;vector;</div>
<div class="line"><a name="l01266"></a><span class="lineno"> 1266</span>&#160;        lim = avec + ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[ht-1])-&gt;vectorsz;</div>
<div class="line"><a name="l01267"></a><span class="lineno"> 1267</span>&#160;        <span class="keywordflow">for</span>(; avec &lt; lim; avec++ , bvec++) *cvec = *avec &amp; *bvec;</div>
<div class="line"><a name="l01268"></a><span class="lineno"> 1268</span>&#160;</div>
<div class="line"><a name="l01269"></a><span class="lineno"> 1269</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = ht-2; i &gt;= 0; i--){</div>
<div class="line"><a name="l01270"></a><span class="lineno"> 1270</span>&#160;                up = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[i+1]);</div>
<div class="line"><a name="l01271"></a><span class="lineno"> 1271</span>&#160;                bvec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)v-&gt;vEBTree&lt;T&gt;::levels[i])-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01272"></a><span class="lineno"> 1272</span>&#160;                bvec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)ret-&gt;vEBTree&lt;T&gt;::levels[i])-&gt;vector;</div>
<div class="line"><a name="l01273"></a><span class="lineno"> 1273</span>&#160;                avec = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[i])-&gt;vector;</div>
<div class="line"><a name="l01274"></a><span class="lineno"> 1274</span>&#160;                size = up-&gt;<a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>();</div>
<div class="line"><a name="l01275"></a><span class="lineno"> 1275</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> j = up-&gt;<a class="code" href="classArrayvEBTree.html#a6036c4756a28f364f661dc0d50646eb4" title="Determine the next element in the set of the specified element.">nextSetElement</a>(0); j &lt; size-1; j = up-&gt;<a class="code" href="classArrayvEBTree.html#a6036c4756a28f364f661dc0d50646eb4" title="Determine the next element in the set of the specified element.">nextSetElement</a>(j+1)){</div>
<div class="line"><a name="l01276"></a><span class="lineno"> 1276</span>&#160;                        cvec[j] = avec[j] &amp; bvec[j];</div>
<div class="line"><a name="l01277"></a><span class="lineno"> 1277</span>&#160;                        <span class="keywordflow">if</span>(cvec[j] == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a8d98a5cf4daaa5afb9a7a17b2980898a" title="Change the value to the specified bit to 0.">toComplInLevel</a>(j);</div>
<div class="line"><a name="l01278"></a><span class="lineno"> 1278</span>&#160;                }</div>
<div class="line"><a name="l01279"></a><span class="lineno"> 1279</span>&#160;                cvec[size-1] = avec[size-1] &amp; bvec[size-1];</div>
<div class="line"><a name="l01280"></a><span class="lineno"> 1280</span>&#160;        }</div>
<div class="line"><a name="l01281"></a><span class="lineno"> 1281</span>&#160;}</div>
<div class="line"><a name="l01282"></a><span class="lineno"> 1282</span>&#160;</div>
<div class="line"><a name="l01283"></a><span class="lineno"> 1283</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01284"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#aa33810c38fe8fe272504dcc3ce9bde13"> 1284</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#aa33810c38fe8fe272504dcc3ce9bde13">ArrayvEBTree&lt;T&gt;::setDiffSimetricSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v){</div>
<div class="line"><a name="l01285"></a><span class="lineno"> 1285</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01286"></a><span class="lineno"> 1286</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01287"></a><span class="lineno"> 1287</span>&#160;        T* lim = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01288"></a><span class="lineno"> 1288</span>&#160;</div>
<div class="line"><a name="l01289"></a><span class="lineno"> 1289</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> &gt; 1){</div>
<div class="line"><a name="l01290"></a><span class="lineno"> 1290</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[1];</div>
<div class="line"><a name="l01291"></a><span class="lineno"> 1291</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01292"></a><span class="lineno"> 1292</span>&#160;                        <span class="keywordflow">if</span>((avec[i] ^= bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01293"></a><span class="lineno"> 1293</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01294"></a><span class="lineno"> 1294</span>&#160;                }</div>
<div class="line"><a name="l01295"></a><span class="lineno"> 1295</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01296"></a><span class="lineno"> 1296</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++){</div>
<div class="line"><a name="l01297"></a><span class="lineno"> 1297</span>&#160;                        *avec ^= *bvec;</div>
<div class="line"><a name="l01298"></a><span class="lineno"> 1298</span>&#160;                }</div>
<div class="line"><a name="l01299"></a><span class="lineno"> 1299</span>&#160;        }</div>
<div class="line"><a name="l01300"></a><span class="lineno"> 1300</span>&#160;}</div>
<div class="line"><a name="l01301"></a><span class="lineno"> 1301</span>&#160;</div>
<div class="line"><a name="l01302"></a><span class="lineno"> 1302</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01303"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a83364fe9bc4ec45082a7fb031aae917d"> 1303</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a83364fe9bc4ec45082a7fb031aae917d">ArrayvEBTree&lt;T&gt;::setDiffSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v){</div>
<div class="line"><a name="l01304"></a><span class="lineno"> 1304</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01305"></a><span class="lineno"> 1305</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01306"></a><span class="lineno"> 1306</span>&#160;        T* lim = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01307"></a><span class="lineno"> 1307</span>&#160;</div>
<div class="line"><a name="l01308"></a><span class="lineno"> 1308</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> &gt; 1){</div>
<div class="line"><a name="l01309"></a><span class="lineno"> 1309</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[1];</div>
<div class="line"><a name="l01310"></a><span class="lineno"> 1310</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01311"></a><span class="lineno"> 1311</span>&#160;                        <span class="keywordflow">if</span>((avec[i] &amp;= ~bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01312"></a><span class="lineno"> 1312</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01313"></a><span class="lineno"> 1313</span>&#160;                }</div>
<div class="line"><a name="l01314"></a><span class="lineno"> 1314</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01315"></a><span class="lineno"> 1315</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++){</div>
<div class="line"><a name="l01316"></a><span class="lineno"> 1316</span>&#160;                        *avec &amp;= ~*bvec;</div>
<div class="line"><a name="l01317"></a><span class="lineno"> 1317</span>&#160;                }</div>
<div class="line"><a name="l01318"></a><span class="lineno"> 1318</span>&#160;        }</div>
<div class="line"><a name="l01319"></a><span class="lineno"> 1319</span>&#160;}</div>
<div class="line"><a name="l01320"></a><span class="lineno"> 1320</span>&#160;</div>
<div class="line"><a name="l01321"></a><span class="lineno"> 1321</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01322"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a62947eac3898e49d856e54bb175f2d9c"> 1322</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#aa33810c38fe8fe272504dcc3ce9bde13">ArrayvEBTree&lt;T&gt;::setDiffSimetricSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res){</div>
<div class="line"><a name="l01323"></a><span class="lineno"> 1323</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01324"></a><span class="lineno"> 1324</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01325"></a><span class="lineno"> 1325</span>&#160;        T* cvec = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01326"></a><span class="lineno"> 1326</span>&#160;        T* lim = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + res-&gt;<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01327"></a><span class="lineno"> 1327</span>&#160;</div>
<div class="line"><a name="l01328"></a><span class="lineno"> 1328</span>&#160;        <span class="keywordflow">if</span>(res-&gt;vEBTree&lt;T&gt;::<a class="code" href="classMultiLevelDirectlyAddressedSet.html#afed049ed58d442204d2e5d9c34491520" title="number of levels">height</a> &gt; 1){</div>
<div class="line"><a name="l01329"></a><span class="lineno"> 1329</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)res-&gt;vEBTree&lt;T&gt;::levels[1];</div>
<div class="line"><a name="l01330"></a><span class="lineno"> 1330</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01331"></a><span class="lineno"> 1331</span>&#160;                        <span class="keywordflow">if</span>((cvec[i] = avec[i] ^ bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01332"></a><span class="lineno"> 1332</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01333"></a><span class="lineno"> 1333</span>&#160;                }</div>
<div class="line"><a name="l01334"></a><span class="lineno"> 1334</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01335"></a><span class="lineno"> 1335</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++, cvec++){</div>
<div class="line"><a name="l01336"></a><span class="lineno"> 1336</span>&#160;                        *cvec = *avec ^ *bvec;</div>
<div class="line"><a name="l01337"></a><span class="lineno"> 1337</span>&#160;                }</div>
<div class="line"><a name="l01338"></a><span class="lineno"> 1338</span>&#160;        }</div>
<div class="line"><a name="l01339"></a><span class="lineno"> 1339</span>&#160;}</div>
<div class="line"><a name="l01340"></a><span class="lineno"> 1340</span>&#160;</div>
<div class="line"><a name="l01341"></a><span class="lineno"> 1341</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01342"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a544c3a5ebb1a11e962089e807de8654f"> 1342</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a83364fe9bc4ec45082a7fb031aae917d">ArrayvEBTree&lt;T&gt;::setDiffSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res){</div>
<div class="line"><a name="l01343"></a><span class="lineno"> 1343</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01344"></a><span class="lineno"> 1344</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01345"></a><span class="lineno"> 1345</span>&#160;        T* cvec = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01346"></a><span class="lineno"> 1346</span>&#160;        T* lim = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + res-&gt;<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01347"></a><span class="lineno"> 1347</span>&#160;</div>
<div class="line"><a name="l01348"></a><span class="lineno"> 1348</span>&#160;        <span class="keywordflow">if</span>(res-&gt;vEBTree&lt;T&gt;::<a class="code" href="classMultiLevelDirectlyAddressedSet.html#afed049ed58d442204d2e5d9c34491520" title="number of levels">height</a> &gt; 1){</div>
<div class="line"><a name="l01349"></a><span class="lineno"> 1349</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)res-&gt;vEBTree&lt;T&gt;::levels[1];</div>
<div class="line"><a name="l01350"></a><span class="lineno"> 1350</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01351"></a><span class="lineno"> 1351</span>&#160;                        <span class="keywordflow">if</span>((cvec[i] = avec[i] &amp; ~bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01352"></a><span class="lineno"> 1352</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01353"></a><span class="lineno"> 1353</span>&#160;                }</div>
<div class="line"><a name="l01354"></a><span class="lineno"> 1354</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01355"></a><span class="lineno"> 1355</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++, cvec++){</div>
<div class="line"><a name="l01356"></a><span class="lineno"> 1356</span>&#160;                        *cvec = *avec &amp; ~*bvec;</div>
<div class="line"><a name="l01357"></a><span class="lineno"> 1357</span>&#160;                }</div>
<div class="line"><a name="l01358"></a><span class="lineno"> 1358</span>&#160;        }</div>
<div class="line"><a name="l01359"></a><span class="lineno"> 1359</span>&#160;}</div>
<div class="line"><a name="l01360"></a><span class="lineno"> 1360</span>&#160;</div>
<div class="line"><a name="l01361"></a><span class="lineno"> 1361</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01362"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a27aa2e8b426adbb6df350f8f8abdd0ac"> 1362</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a27aa2e8b426adbb6df350f8f8abdd0ac">ArrayvEBTree&lt;T&gt;::complUnionSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v){</div>
<div class="line"><a name="l01363"></a><span class="lineno"> 1363</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01364"></a><span class="lineno"> 1364</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01365"></a><span class="lineno"> 1365</span>&#160;        T* lim = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01366"></a><span class="lineno"> 1366</span>&#160;</div>
<div class="line"><a name="l01367"></a><span class="lineno"> 1367</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> &gt; 1){</div>
<div class="line"><a name="l01368"></a><span class="lineno"> 1368</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[1];</div>
<div class="line"><a name="l01369"></a><span class="lineno"> 1369</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01370"></a><span class="lineno"> 1370</span>&#160;                        <span class="keywordflow">if</span>((avec[i] = ~avec[i] | bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01371"></a><span class="lineno"> 1371</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01372"></a><span class="lineno"> 1372</span>&#160;                }</div>
<div class="line"><a name="l01373"></a><span class="lineno"> 1373</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01374"></a><span class="lineno"> 1374</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++){</div>
<div class="line"><a name="l01375"></a><span class="lineno"> 1375</span>&#160;                        *avec = ~*avec | *bvec;</div>
<div class="line"><a name="l01376"></a><span class="lineno"> 1376</span>&#160;                }</div>
<div class="line"><a name="l01377"></a><span class="lineno"> 1377</span>&#160;        }</div>
<div class="line"><a name="l01378"></a><span class="lineno"> 1378</span>&#160;}</div>
<div class="line"><a name="l01379"></a><span class="lineno"> 1379</span>&#160;</div>
<div class="line"><a name="l01380"></a><span class="lineno"> 1380</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01381"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a4967f0271560cccee164df6d688021bc"> 1381</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a4967f0271560cccee164df6d688021bc">ArrayvEBTree&lt;T&gt;::complDiffSimetricSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v){</div>
<div class="line"><a name="l01382"></a><span class="lineno"> 1382</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01383"></a><span class="lineno"> 1383</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01384"></a><span class="lineno"> 1384</span>&#160;        T* lim = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01385"></a><span class="lineno"> 1385</span>&#160;</div>
<div class="line"><a name="l01386"></a><span class="lineno"> 1386</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> &gt; 1){</div>
<div class="line"><a name="l01387"></a><span class="lineno"> 1387</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[1];</div>
<div class="line"><a name="l01388"></a><span class="lineno"> 1388</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01389"></a><span class="lineno"> 1389</span>&#160;                        <span class="keywordflow">if</span>((avec[i] = ~avec[i] ^ bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01390"></a><span class="lineno"> 1390</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01391"></a><span class="lineno"> 1391</span>&#160;                }</div>
<div class="line"><a name="l01392"></a><span class="lineno"> 1392</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01393"></a><span class="lineno"> 1393</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++){</div>
<div class="line"><a name="l01394"></a><span class="lineno"> 1394</span>&#160;                        *avec = ~*avec ^ *bvec;</div>
<div class="line"><a name="l01395"></a><span class="lineno"> 1395</span>&#160;                }</div>
<div class="line"><a name="l01396"></a><span class="lineno"> 1396</span>&#160;        }</div>
<div class="line"><a name="l01397"></a><span class="lineno"> 1397</span>&#160;}</div>
<div class="line"><a name="l01398"></a><span class="lineno"> 1398</span>&#160;</div>
<div class="line"><a name="l01399"></a><span class="lineno"> 1399</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01400"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a0b08a3b3c8360bb05a6cc689bad97548"> 1400</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a0b08a3b3c8360bb05a6cc689bad97548">ArrayvEBTree&lt;T&gt;::complIntersecSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v){</div>
<div class="line"><a name="l01401"></a><span class="lineno"> 1401</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01402"></a><span class="lineno"> 1402</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01403"></a><span class="lineno"> 1403</span>&#160;        T* lim = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01404"></a><span class="lineno"> 1404</span>&#160;</div>
<div class="line"><a name="l01405"></a><span class="lineno"> 1405</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> &gt; 1){</div>
<div class="line"><a name="l01406"></a><span class="lineno"> 1406</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[1];</div>
<div class="line"><a name="l01407"></a><span class="lineno"> 1407</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01408"></a><span class="lineno"> 1408</span>&#160;                        <span class="keywordflow">if</span>((avec[i] = ~avec[i] &amp; bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01409"></a><span class="lineno"> 1409</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01410"></a><span class="lineno"> 1410</span>&#160;                }</div>
<div class="line"><a name="l01411"></a><span class="lineno"> 1411</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01412"></a><span class="lineno"> 1412</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++){</div>
<div class="line"><a name="l01413"></a><span class="lineno"> 1413</span>&#160;                        *avec = ~*avec &amp; *bvec;</div>
<div class="line"><a name="l01414"></a><span class="lineno"> 1414</span>&#160;                }</div>
<div class="line"><a name="l01415"></a><span class="lineno"> 1415</span>&#160;        }</div>
<div class="line"><a name="l01416"></a><span class="lineno"> 1416</span>&#160;}</div>
<div class="line"><a name="l01417"></a><span class="lineno"> 1417</span>&#160;</div>
<div class="line"><a name="l01418"></a><span class="lineno"> 1418</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01419"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#ae60c831276e2251050347b2d6ff6c623"> 1419</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#ae60c831276e2251050347b2d6ff6c623">ArrayvEBTree&lt;T&gt;::complDiffSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v){</div>
<div class="line"><a name="l01420"></a><span class="lineno"> 1420</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01421"></a><span class="lineno"> 1421</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01422"></a><span class="lineno"> 1422</span>&#160;        T* lim = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01423"></a><span class="lineno"> 1423</span>&#160;</div>
<div class="line"><a name="l01424"></a><span class="lineno"> 1424</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> &gt; 1){</div>
<div class="line"><a name="l01425"></a><span class="lineno"> 1425</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[1];</div>
<div class="line"><a name="l01426"></a><span class="lineno"> 1426</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01427"></a><span class="lineno"> 1427</span>&#160;                        <span class="keywordflow">if</span>((avec[i] = ~avec[i] &amp; ~bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01428"></a><span class="lineno"> 1428</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01429"></a><span class="lineno"> 1429</span>&#160;                }</div>
<div class="line"><a name="l01430"></a><span class="lineno"> 1430</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01431"></a><span class="lineno"> 1431</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++){</div>
<div class="line"><a name="l01432"></a><span class="lineno"> 1432</span>&#160;                        *avec = ~*avec &amp; ~*bvec;</div>
<div class="line"><a name="l01433"></a><span class="lineno"> 1433</span>&#160;                }</div>
<div class="line"><a name="l01434"></a><span class="lineno"> 1434</span>&#160;        }</div>
<div class="line"><a name="l01435"></a><span class="lineno"> 1435</span>&#160;}</div>
<div class="line"><a name="l01436"></a><span class="lineno"> 1436</span>&#160;</div>
<div class="line"><a name="l01437"></a><span class="lineno"> 1437</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01438"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a6394cf8fd7931705c2fc405f2b5a1058"> 1438</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a27aa2e8b426adbb6df350f8f8abdd0ac">ArrayvEBTree&lt;T&gt;::complUnionSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res){</div>
<div class="line"><a name="l01439"></a><span class="lineno"> 1439</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01440"></a><span class="lineno"> 1440</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01441"></a><span class="lineno"> 1441</span>&#160;        T* cvec = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01442"></a><span class="lineno"> 1442</span>&#160;        T* lim = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + res-&gt;<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01443"></a><span class="lineno"> 1443</span>&#160;</div>
<div class="line"><a name="l01444"></a><span class="lineno"> 1444</span>&#160;        <span class="keywordflow">if</span>(res-&gt;vEBTree&lt;T&gt;::<a class="code" href="classMultiLevelDirectlyAddressedSet.html#afed049ed58d442204d2e5d9c34491520" title="number of levels">height</a> &gt; 1){</div>
<div class="line"><a name="l01445"></a><span class="lineno"> 1445</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)res-&gt;vEBTree&lt;T&gt;::levels[1];</div>
<div class="line"><a name="l01446"></a><span class="lineno"> 1446</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01447"></a><span class="lineno"> 1447</span>&#160;                        <span class="keywordflow">if</span>((cvec[i] = ~avec[i] | bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01448"></a><span class="lineno"> 1448</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01449"></a><span class="lineno"> 1449</span>&#160;                }</div>
<div class="line"><a name="l01450"></a><span class="lineno"> 1450</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01451"></a><span class="lineno"> 1451</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++, cvec++){</div>
<div class="line"><a name="l01452"></a><span class="lineno"> 1452</span>&#160;                        *cvec = ~*avec | *bvec;</div>
<div class="line"><a name="l01453"></a><span class="lineno"> 1453</span>&#160;                }</div>
<div class="line"><a name="l01454"></a><span class="lineno"> 1454</span>&#160;        }</div>
<div class="line"><a name="l01455"></a><span class="lineno"> 1455</span>&#160;}</div>
<div class="line"><a name="l01456"></a><span class="lineno"> 1456</span>&#160;</div>
<div class="line"><a name="l01457"></a><span class="lineno"> 1457</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01458"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#ab56803fc6d3a16329e780983484f2284"> 1458</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a4967f0271560cccee164df6d688021bc">ArrayvEBTree&lt;T&gt;::complDiffSimetricSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res){</div>
<div class="line"><a name="l01459"></a><span class="lineno"> 1459</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01460"></a><span class="lineno"> 1460</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01461"></a><span class="lineno"> 1461</span>&#160;        T* cvec = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01462"></a><span class="lineno"> 1462</span>&#160;        T* lim = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + res-&gt;<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01463"></a><span class="lineno"> 1463</span>&#160;</div>
<div class="line"><a name="l01464"></a><span class="lineno"> 1464</span>&#160;        <span class="keywordflow">if</span>(res-&gt;vEBTree&lt;T&gt;::<a class="code" href="classMultiLevelDirectlyAddressedSet.html#afed049ed58d442204d2e5d9c34491520" title="number of levels">height</a> &gt; 1){</div>
<div class="line"><a name="l01465"></a><span class="lineno"> 1465</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)res-&gt;vEBTree&lt;T&gt;::levels[1];</div>
<div class="line"><a name="l01466"></a><span class="lineno"> 1466</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01467"></a><span class="lineno"> 1467</span>&#160;                        <span class="keywordflow">if</span>((cvec[i] = ~avec[i] ^ bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01468"></a><span class="lineno"> 1468</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01469"></a><span class="lineno"> 1469</span>&#160;                }</div>
<div class="line"><a name="l01470"></a><span class="lineno"> 1470</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01471"></a><span class="lineno"> 1471</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++, cvec++){</div>
<div class="line"><a name="l01472"></a><span class="lineno"> 1472</span>&#160;                        *cvec = ~*avec ^ *bvec;</div>
<div class="line"><a name="l01473"></a><span class="lineno"> 1473</span>&#160;                }</div>
<div class="line"><a name="l01474"></a><span class="lineno"> 1474</span>&#160;        }</div>
<div class="line"><a name="l01475"></a><span class="lineno"> 1475</span>&#160;}</div>
<div class="line"><a name="l01476"></a><span class="lineno"> 1476</span>&#160;</div>
<div class="line"><a name="l01477"></a><span class="lineno"> 1477</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01478"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a4a9d0cc0cfd47a708dbd8f4d993fd353"> 1478</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a0b08a3b3c8360bb05a6cc689bad97548">ArrayvEBTree&lt;T&gt;::complIntersecSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res){</div>
<div class="line"><a name="l01479"></a><span class="lineno"> 1479</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01480"></a><span class="lineno"> 1480</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01481"></a><span class="lineno"> 1481</span>&#160;        T* cvec = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01482"></a><span class="lineno"> 1482</span>&#160;        T* lim = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + res-&gt;<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01483"></a><span class="lineno"> 1483</span>&#160;</div>
<div class="line"><a name="l01484"></a><span class="lineno"> 1484</span>&#160;        <span class="keywordflow">if</span>(res-&gt;vEBTree&lt;T&gt;::<a class="code" href="classMultiLevelDirectlyAddressedSet.html#afed049ed58d442204d2e5d9c34491520" title="number of levels">height</a> &gt; 1){</div>
<div class="line"><a name="l01485"></a><span class="lineno"> 1485</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)res-&gt;vEBTree&lt;T&gt;::levels[1];</div>
<div class="line"><a name="l01486"></a><span class="lineno"> 1486</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01487"></a><span class="lineno"> 1487</span>&#160;                        <span class="keywordflow">if</span>((cvec[i] = ~avec[i] &amp; bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01488"></a><span class="lineno"> 1488</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01489"></a><span class="lineno"> 1489</span>&#160;                }</div>
<div class="line"><a name="l01490"></a><span class="lineno"> 1490</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01491"></a><span class="lineno"> 1491</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++, cvec++){</div>
<div class="line"><a name="l01492"></a><span class="lineno"> 1492</span>&#160;                        *cvec = ~*avec &amp; *bvec;</div>
<div class="line"><a name="l01493"></a><span class="lineno"> 1493</span>&#160;                }</div>
<div class="line"><a name="l01494"></a><span class="lineno"> 1494</span>&#160;        }</div>
<div class="line"><a name="l01495"></a><span class="lineno"> 1495</span>&#160;}</div>
<div class="line"><a name="l01496"></a><span class="lineno"> 1496</span>&#160;</div>
<div class="line"><a name="l01497"></a><span class="lineno"> 1497</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01498"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a7dfa63df292aa24264b2e6b9fe62aa00"> 1498</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#ae60c831276e2251050347b2d6ff6c623">ArrayvEBTree&lt;T&gt;::complDiffSet</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res){</div>
<div class="line"><a name="l01499"></a><span class="lineno"> 1499</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01500"></a><span class="lineno"> 1500</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01501"></a><span class="lineno"> 1501</span>&#160;        T* cvec = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01502"></a><span class="lineno"> 1502</span>&#160;        T* lim = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + res-&gt;<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01503"></a><span class="lineno"> 1503</span>&#160;</div>
<div class="line"><a name="l01504"></a><span class="lineno"> 1504</span>&#160;        <span class="keywordflow">if</span>(res-&gt;vEBTree&lt;T&gt;::<a class="code" href="classMultiLevelDirectlyAddressedSet.html#afed049ed58d442204d2e5d9c34491520" title="number of levels">height</a> &gt; 1){</div>
<div class="line"><a name="l01505"></a><span class="lineno"> 1505</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)res-&gt;vEBTree&lt;T&gt;::levels[1];</div>
<div class="line"><a name="l01506"></a><span class="lineno"> 1506</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01507"></a><span class="lineno"> 1507</span>&#160;                        <span class="keywordflow">if</span>((cvec[i] = avec[i] &amp; ~bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01508"></a><span class="lineno"> 1508</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01509"></a><span class="lineno"> 1509</span>&#160;                }</div>
<div class="line"><a name="l01510"></a><span class="lineno"> 1510</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01511"></a><span class="lineno"> 1511</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++, cvec++){</div>
<div class="line"><a name="l01512"></a><span class="lineno"> 1512</span>&#160;                        *cvec = *avec &amp; ~*bvec;</div>
<div class="line"><a name="l01513"></a><span class="lineno"> 1513</span>&#160;                }</div>
<div class="line"><a name="l01514"></a><span class="lineno"> 1514</span>&#160;        }</div>
<div class="line"><a name="l01515"></a><span class="lineno"> 1515</span>&#160;}</div>
<div class="line"><a name="l01516"></a><span class="lineno"> 1516</span>&#160;</div>
<div class="line"><a name="l01517"></a><span class="lineno"> 1517</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01518"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#ae79457c615a968f941ca039290255d8a"> 1518</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#ae79457c615a968f941ca039290255d8a">ArrayvEBTree&lt;T&gt;::setUnionCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v){</div>
<div class="line"><a name="l01519"></a><span class="lineno"> 1519</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01520"></a><span class="lineno"> 1520</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01521"></a><span class="lineno"> 1521</span>&#160;        T* lim = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01522"></a><span class="lineno"> 1522</span>&#160;</div>
<div class="line"><a name="l01523"></a><span class="lineno"> 1523</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> &gt; 1){</div>
<div class="line"><a name="l01524"></a><span class="lineno"> 1524</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[1];</div>
<div class="line"><a name="l01525"></a><span class="lineno"> 1525</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01526"></a><span class="lineno"> 1526</span>&#160;                        <span class="keywordflow">if</span>((avec[i] = avec[i] | ~bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01527"></a><span class="lineno"> 1527</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01528"></a><span class="lineno"> 1528</span>&#160;                }</div>
<div class="line"><a name="l01529"></a><span class="lineno"> 1529</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01530"></a><span class="lineno"> 1530</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++){</div>
<div class="line"><a name="l01531"></a><span class="lineno"> 1531</span>&#160;                        *avec = *avec | ~*bvec;</div>
<div class="line"><a name="l01532"></a><span class="lineno"> 1532</span>&#160;                }</div>
<div class="line"><a name="l01533"></a><span class="lineno"> 1533</span>&#160;        }</div>
<div class="line"><a name="l01534"></a><span class="lineno"> 1534</span>&#160;}</div>
<div class="line"><a name="l01535"></a><span class="lineno"> 1535</span>&#160;</div>
<div class="line"><a name="l01536"></a><span class="lineno"> 1536</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01537"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a61df6aaf918dd124ed1bc28ee2d61519"> 1537</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a61df6aaf918dd124ed1bc28ee2d61519">ArrayvEBTree&lt;T&gt;::setDiffSimetricCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v){</div>
<div class="line"><a name="l01538"></a><span class="lineno"> 1538</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01539"></a><span class="lineno"> 1539</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01540"></a><span class="lineno"> 1540</span>&#160;        T* lim = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01541"></a><span class="lineno"> 1541</span>&#160;</div>
<div class="line"><a name="l01542"></a><span class="lineno"> 1542</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> &gt; 1){</div>
<div class="line"><a name="l01543"></a><span class="lineno"> 1543</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[1];</div>
<div class="line"><a name="l01544"></a><span class="lineno"> 1544</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01545"></a><span class="lineno"> 1545</span>&#160;                        <span class="keywordflow">if</span>((avec[i] = avec[i] ^ ~bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01546"></a><span class="lineno"> 1546</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01547"></a><span class="lineno"> 1547</span>&#160;                }</div>
<div class="line"><a name="l01548"></a><span class="lineno"> 1548</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01549"></a><span class="lineno"> 1549</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++){</div>
<div class="line"><a name="l01550"></a><span class="lineno"> 1550</span>&#160;                        *avec = *avec ^ ~*bvec;</div>
<div class="line"><a name="l01551"></a><span class="lineno"> 1551</span>&#160;                }</div>
<div class="line"><a name="l01552"></a><span class="lineno"> 1552</span>&#160;        }</div>
<div class="line"><a name="l01553"></a><span class="lineno"> 1553</span>&#160;}</div>
<div class="line"><a name="l01554"></a><span class="lineno"> 1554</span>&#160;</div>
<div class="line"><a name="l01555"></a><span class="lineno"> 1555</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01556"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#adc2ffe19e223a72c66b51730163c2d26"> 1556</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#adc2ffe19e223a72c66b51730163c2d26">ArrayvEBTree&lt;T&gt;::setIntersecCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v){</div>
<div class="line"><a name="l01557"></a><span class="lineno"> 1557</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01558"></a><span class="lineno"> 1558</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01559"></a><span class="lineno"> 1559</span>&#160;        T* lim = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01560"></a><span class="lineno"> 1560</span>&#160;</div>
<div class="line"><a name="l01561"></a><span class="lineno"> 1561</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> &gt; 1){</div>
<div class="line"><a name="l01562"></a><span class="lineno"> 1562</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[1];</div>
<div class="line"><a name="l01563"></a><span class="lineno"> 1563</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01564"></a><span class="lineno"> 1564</span>&#160;                        <span class="keywordflow">if</span>((avec[i] = avec[i] &amp; ~bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01565"></a><span class="lineno"> 1565</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01566"></a><span class="lineno"> 1566</span>&#160;                }</div>
<div class="line"><a name="l01567"></a><span class="lineno"> 1567</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01568"></a><span class="lineno"> 1568</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++){</div>
<div class="line"><a name="l01569"></a><span class="lineno"> 1569</span>&#160;                        *avec = *avec &amp; ~*bvec;</div>
<div class="line"><a name="l01570"></a><span class="lineno"> 1570</span>&#160;                }</div>
<div class="line"><a name="l01571"></a><span class="lineno"> 1571</span>&#160;        }</div>
<div class="line"><a name="l01572"></a><span class="lineno"> 1572</span>&#160;}</div>
<div class="line"><a name="l01573"></a><span class="lineno"> 1573</span>&#160;</div>
<div class="line"><a name="l01574"></a><span class="lineno"> 1574</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01575"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a66d503faf6d49dd6a0292f9a9b8b3cd0"> 1575</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a66d503faf6d49dd6a0292f9a9b8b3cd0">ArrayvEBTree&lt;T&gt;::setDiffCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v){</div>
<div class="line"><a name="l01576"></a><span class="lineno"> 1576</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01577"></a><span class="lineno"> 1577</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01578"></a><span class="lineno"> 1578</span>&#160;        T* lim = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01579"></a><span class="lineno"> 1579</span>&#160;</div>
<div class="line"><a name="l01580"></a><span class="lineno"> 1580</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> &gt; 1){</div>
<div class="line"><a name="l01581"></a><span class="lineno"> 1581</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[1];</div>
<div class="line"><a name="l01582"></a><span class="lineno"> 1582</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01583"></a><span class="lineno"> 1583</span>&#160;                        <span class="keywordflow">if</span>((avec[i] = avec[i] &amp; bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01584"></a><span class="lineno"> 1584</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01585"></a><span class="lineno"> 1585</span>&#160;                }</div>
<div class="line"><a name="l01586"></a><span class="lineno"> 1586</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01587"></a><span class="lineno"> 1587</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++){</div>
<div class="line"><a name="l01588"></a><span class="lineno"> 1588</span>&#160;                        *avec = *avec &amp; *bvec;</div>
<div class="line"><a name="l01589"></a><span class="lineno"> 1589</span>&#160;                }</div>
<div class="line"><a name="l01590"></a><span class="lineno"> 1590</span>&#160;        }</div>
<div class="line"><a name="l01591"></a><span class="lineno"> 1591</span>&#160;}</div>
<div class="line"><a name="l01592"></a><span class="lineno"> 1592</span>&#160;</div>
<div class="line"><a name="l01593"></a><span class="lineno"> 1593</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01594"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a2ca2cf4d5659cd8cf867bff0fec005e2"> 1594</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#ae79457c615a968f941ca039290255d8a">ArrayvEBTree&lt;T&gt;::setUnionCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res){</div>
<div class="line"><a name="l01595"></a><span class="lineno"> 1595</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01596"></a><span class="lineno"> 1596</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01597"></a><span class="lineno"> 1597</span>&#160;        T* cvec = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01598"></a><span class="lineno"> 1598</span>&#160;        T* lim = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + res-&gt;<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01599"></a><span class="lineno"> 1599</span>&#160;</div>
<div class="line"><a name="l01600"></a><span class="lineno"> 1600</span>&#160;        <span class="keywordflow">if</span>(res-&gt;vEBTree&lt;T&gt;::<a class="code" href="classMultiLevelDirectlyAddressedSet.html#afed049ed58d442204d2e5d9c34491520" title="number of levels">height</a> &gt; 1){</div>
<div class="line"><a name="l01601"></a><span class="lineno"> 1601</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)res-&gt;vEBTree&lt;T&gt;::levels[1];</div>
<div class="line"><a name="l01602"></a><span class="lineno"> 1602</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01603"></a><span class="lineno"> 1603</span>&#160;                        <span class="keywordflow">if</span>((cvec[i] = avec[i] | ~bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01604"></a><span class="lineno"> 1604</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01605"></a><span class="lineno"> 1605</span>&#160;                }</div>
<div class="line"><a name="l01606"></a><span class="lineno"> 1606</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01607"></a><span class="lineno"> 1607</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++, cvec++){</div>
<div class="line"><a name="l01608"></a><span class="lineno"> 1608</span>&#160;                        *cvec = *avec | ~*bvec;</div>
<div class="line"><a name="l01609"></a><span class="lineno"> 1609</span>&#160;                }</div>
<div class="line"><a name="l01610"></a><span class="lineno"> 1610</span>&#160;        }</div>
<div class="line"><a name="l01611"></a><span class="lineno"> 1611</span>&#160;}</div>
<div class="line"><a name="l01612"></a><span class="lineno"> 1612</span>&#160;</div>
<div class="line"><a name="l01613"></a><span class="lineno"> 1613</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01614"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a0b54edcb18a3e34b6b214120cc27a80f"> 1614</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a61df6aaf918dd124ed1bc28ee2d61519">ArrayvEBTree&lt;T&gt;::setDiffSimetricCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res){</div>
<div class="line"><a name="l01615"></a><span class="lineno"> 1615</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01616"></a><span class="lineno"> 1616</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01617"></a><span class="lineno"> 1617</span>&#160;        T* cvec = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01618"></a><span class="lineno"> 1618</span>&#160;        T* lim = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + res-&gt;<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01619"></a><span class="lineno"> 1619</span>&#160;</div>
<div class="line"><a name="l01620"></a><span class="lineno"> 1620</span>&#160;        <span class="keywordflow">if</span>(res-&gt;vEBTree&lt;T&gt;::<a class="code" href="classMultiLevelDirectlyAddressedSet.html#afed049ed58d442204d2e5d9c34491520" title="number of levels">height</a> &gt; 1){</div>
<div class="line"><a name="l01621"></a><span class="lineno"> 1621</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)res-&gt;vEBTree&lt;T&gt;::levels[1];</div>
<div class="line"><a name="l01622"></a><span class="lineno"> 1622</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01623"></a><span class="lineno"> 1623</span>&#160;                        <span class="keywordflow">if</span>((cvec[i] = avec[i] ^ ~bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01624"></a><span class="lineno"> 1624</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01625"></a><span class="lineno"> 1625</span>&#160;                }</div>
<div class="line"><a name="l01626"></a><span class="lineno"> 1626</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01627"></a><span class="lineno"> 1627</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++, cvec++){</div>
<div class="line"><a name="l01628"></a><span class="lineno"> 1628</span>&#160;                        *cvec = *avec ^ ~*bvec;</div>
<div class="line"><a name="l01629"></a><span class="lineno"> 1629</span>&#160;                }</div>
<div class="line"><a name="l01630"></a><span class="lineno"> 1630</span>&#160;        }</div>
<div class="line"><a name="l01631"></a><span class="lineno"> 1631</span>&#160;}</div>
<div class="line"><a name="l01632"></a><span class="lineno"> 1632</span>&#160;</div>
<div class="line"><a name="l01633"></a><span class="lineno"> 1633</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01634"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a6d88436aaaf81abafefd840510aa07e5"> 1634</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#adc2ffe19e223a72c66b51730163c2d26">ArrayvEBTree&lt;T&gt;::setIntersecCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res){</div>
<div class="line"><a name="l01635"></a><span class="lineno"> 1635</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01636"></a><span class="lineno"> 1636</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01637"></a><span class="lineno"> 1637</span>&#160;        T* cvec = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01638"></a><span class="lineno"> 1638</span>&#160;        T* lim = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + res-&gt;<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01639"></a><span class="lineno"> 1639</span>&#160;</div>
<div class="line"><a name="l01640"></a><span class="lineno"> 1640</span>&#160;        <span class="keywordflow">if</span>(res-&gt;vEBTree&lt;T&gt;::<a class="code" href="classMultiLevelDirectlyAddressedSet.html#afed049ed58d442204d2e5d9c34491520" title="number of levels">height</a> &gt; 1){</div>
<div class="line"><a name="l01641"></a><span class="lineno"> 1641</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)res-&gt;vEBTree&lt;T&gt;::levels[1];</div>
<div class="line"><a name="l01642"></a><span class="lineno"> 1642</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01643"></a><span class="lineno"> 1643</span>&#160;                        <span class="keywordflow">if</span>((cvec[i] = avec[i] &amp; ~bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01644"></a><span class="lineno"> 1644</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01645"></a><span class="lineno"> 1645</span>&#160;                }</div>
<div class="line"><a name="l01646"></a><span class="lineno"> 1646</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01647"></a><span class="lineno"> 1647</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++, cvec++){</div>
<div class="line"><a name="l01648"></a><span class="lineno"> 1648</span>&#160;                        *cvec = *avec &amp; ~*bvec;</div>
<div class="line"><a name="l01649"></a><span class="lineno"> 1649</span>&#160;                }</div>
<div class="line"><a name="l01650"></a><span class="lineno"> 1650</span>&#160;        }</div>
<div class="line"><a name="l01651"></a><span class="lineno"> 1651</span>&#160;}</div>
<div class="line"><a name="l01652"></a><span class="lineno"> 1652</span>&#160;</div>
<div class="line"><a name="l01653"></a><span class="lineno"> 1653</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01654"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a77ec0d36be9e6c11766177376c1989ae"> 1654</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a66d503faf6d49dd6a0292f9a9b8b3cd0">ArrayvEBTree&lt;T&gt;::setDiffCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res){</div>
<div class="line"><a name="l01655"></a><span class="lineno"> 1655</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01656"></a><span class="lineno"> 1656</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01657"></a><span class="lineno"> 1657</span>&#160;        T* cvec = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01658"></a><span class="lineno"> 1658</span>&#160;        T* lim = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + res-&gt;<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01659"></a><span class="lineno"> 1659</span>&#160;</div>
<div class="line"><a name="l01660"></a><span class="lineno"> 1660</span>&#160;        <span class="keywordflow">if</span>(res-&gt;vEBTree&lt;T&gt;::<a class="code" href="classMultiLevelDirectlyAddressedSet.html#afed049ed58d442204d2e5d9c34491520" title="number of levels">height</a> &gt; 1){</div>
<div class="line"><a name="l01661"></a><span class="lineno"> 1661</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)res-&gt;vEBTree&lt;T&gt;::levels[1];</div>
<div class="line"><a name="l01662"></a><span class="lineno"> 1662</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01663"></a><span class="lineno"> 1663</span>&#160;                        <span class="keywordflow">if</span>((cvec[i] = avec[i] &amp; bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01664"></a><span class="lineno"> 1664</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01665"></a><span class="lineno"> 1665</span>&#160;                }</div>
<div class="line"><a name="l01666"></a><span class="lineno"> 1666</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01667"></a><span class="lineno"> 1667</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++, cvec++){</div>
<div class="line"><a name="l01668"></a><span class="lineno"> 1668</span>&#160;                        *cvec = *avec &amp; *bvec;</div>
<div class="line"><a name="l01669"></a><span class="lineno"> 1669</span>&#160;                }</div>
<div class="line"><a name="l01670"></a><span class="lineno"> 1670</span>&#160;        }</div>
<div class="line"><a name="l01671"></a><span class="lineno"> 1671</span>&#160;}</div>
<div class="line"><a name="l01672"></a><span class="lineno"> 1672</span>&#160;</div>
<div class="line"><a name="l01673"></a><span class="lineno"> 1673</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01674"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#abcd6e8cee331bbc49f9b36f5102a3ec3"> 1674</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#abcd6e8cee331bbc49f9b36f5102a3ec3">ArrayvEBTree&lt;T&gt;::complUnionCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v){</div>
<div class="line"><a name="l01675"></a><span class="lineno"> 1675</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01676"></a><span class="lineno"> 1676</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01677"></a><span class="lineno"> 1677</span>&#160;        T* lim = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01678"></a><span class="lineno"> 1678</span>&#160;</div>
<div class="line"><a name="l01679"></a><span class="lineno"> 1679</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> &gt; 1){</div>
<div class="line"><a name="l01680"></a><span class="lineno"> 1680</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[1];</div>
<div class="line"><a name="l01681"></a><span class="lineno"> 1681</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01682"></a><span class="lineno"> 1682</span>&#160;                        <span class="keywordflow">if</span>((avec[i] = ~avec[i] | ~bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01683"></a><span class="lineno"> 1683</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01684"></a><span class="lineno"> 1684</span>&#160;                }</div>
<div class="line"><a name="l01685"></a><span class="lineno"> 1685</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01686"></a><span class="lineno"> 1686</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++){</div>
<div class="line"><a name="l01687"></a><span class="lineno"> 1687</span>&#160;                        *avec = ~*avec | ~*bvec;</div>
<div class="line"><a name="l01688"></a><span class="lineno"> 1688</span>&#160;                }</div>
<div class="line"><a name="l01689"></a><span class="lineno"> 1689</span>&#160;        }</div>
<div class="line"><a name="l01690"></a><span class="lineno"> 1690</span>&#160;}</div>
<div class="line"><a name="l01691"></a><span class="lineno"> 1691</span>&#160;</div>
<div class="line"><a name="l01692"></a><span class="lineno"> 1692</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01693"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a946fde97c4c461900c6c1e5ff053d65b"> 1693</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a946fde97c4c461900c6c1e5ff053d65b">ArrayvEBTree&lt;T&gt;::complDiffSimetricCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v){</div>
<div class="line"><a name="l01694"></a><span class="lineno"> 1694</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01695"></a><span class="lineno"> 1695</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01696"></a><span class="lineno"> 1696</span>&#160;        T* lim = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01697"></a><span class="lineno"> 1697</span>&#160;</div>
<div class="line"><a name="l01698"></a><span class="lineno"> 1698</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> &gt; 1){</div>
<div class="line"><a name="l01699"></a><span class="lineno"> 1699</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[1];</div>
<div class="line"><a name="l01700"></a><span class="lineno"> 1700</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01701"></a><span class="lineno"> 1701</span>&#160;                        <span class="keywordflow">if</span>((avec[i] = ~avec[i] ^ ~bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01702"></a><span class="lineno"> 1702</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01703"></a><span class="lineno"> 1703</span>&#160;                }</div>
<div class="line"><a name="l01704"></a><span class="lineno"> 1704</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01705"></a><span class="lineno"> 1705</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++){</div>
<div class="line"><a name="l01706"></a><span class="lineno"> 1706</span>&#160;                        *avec = ~*avec ^ ~*bvec;</div>
<div class="line"><a name="l01707"></a><span class="lineno"> 1707</span>&#160;                }</div>
<div class="line"><a name="l01708"></a><span class="lineno"> 1708</span>&#160;        }</div>
<div class="line"><a name="l01709"></a><span class="lineno"> 1709</span>&#160;}</div>
<div class="line"><a name="l01710"></a><span class="lineno"> 1710</span>&#160;</div>
<div class="line"><a name="l01711"></a><span class="lineno"> 1711</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01712"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a1a4c451e61971b4493bb9daefc5b559c"> 1712</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a1a4c451e61971b4493bb9daefc5b559c">ArrayvEBTree&lt;T&gt;::complIntersecCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v){</div>
<div class="line"><a name="l01713"></a><span class="lineno"> 1713</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01714"></a><span class="lineno"> 1714</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01715"></a><span class="lineno"> 1715</span>&#160;        T* lim = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01716"></a><span class="lineno"> 1716</span>&#160;</div>
<div class="line"><a name="l01717"></a><span class="lineno"> 1717</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> &gt; 1){</div>
<div class="line"><a name="l01718"></a><span class="lineno"> 1718</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[1];</div>
<div class="line"><a name="l01719"></a><span class="lineno"> 1719</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01720"></a><span class="lineno"> 1720</span>&#160;                        <span class="keywordflow">if</span>((avec[i] = ~avec[i] &amp; ~bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01721"></a><span class="lineno"> 1721</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01722"></a><span class="lineno"> 1722</span>&#160;                }</div>
<div class="line"><a name="l01723"></a><span class="lineno"> 1723</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01724"></a><span class="lineno"> 1724</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++){</div>
<div class="line"><a name="l01725"></a><span class="lineno"> 1725</span>&#160;                        *avec = ~*avec &amp; ~*bvec;</div>
<div class="line"><a name="l01726"></a><span class="lineno"> 1726</span>&#160;                }</div>
<div class="line"><a name="l01727"></a><span class="lineno"> 1727</span>&#160;        }</div>
<div class="line"><a name="l01728"></a><span class="lineno"> 1728</span>&#160;}</div>
<div class="line"><a name="l01729"></a><span class="lineno"> 1729</span>&#160;</div>
<div class="line"><a name="l01730"></a><span class="lineno"> 1730</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01731"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#aab6c709db21c6d3f635add33ef487858"> 1731</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#aab6c709db21c6d3f635add33ef487858">ArrayvEBTree&lt;T&gt;::complDiffCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v){</div>
<div class="line"><a name="l01732"></a><span class="lineno"> 1732</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01733"></a><span class="lineno"> 1733</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01734"></a><span class="lineno"> 1734</span>&#160;        T* lim = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01735"></a><span class="lineno"> 1735</span>&#160;</div>
<div class="line"><a name="l01736"></a><span class="lineno"> 1736</span>&#160;        <span class="keywordflow">if</span>(<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> &gt; 1){</div>
<div class="line"><a name="l01737"></a><span class="lineno"> 1737</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[1];</div>
<div class="line"><a name="l01738"></a><span class="lineno"> 1738</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01739"></a><span class="lineno"> 1739</span>&#160;                        <span class="keywordflow">if</span>((avec[i] = ~avec[i] &amp; bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01740"></a><span class="lineno"> 1740</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01741"></a><span class="lineno"> 1741</span>&#160;                }</div>
<div class="line"><a name="l01742"></a><span class="lineno"> 1742</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01743"></a><span class="lineno"> 1743</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++){</div>
<div class="line"><a name="l01744"></a><span class="lineno"> 1744</span>&#160;                        *avec = ~*avec &amp; *bvec;</div>
<div class="line"><a name="l01745"></a><span class="lineno"> 1745</span>&#160;                }</div>
<div class="line"><a name="l01746"></a><span class="lineno"> 1746</span>&#160;        }</div>
<div class="line"><a name="l01747"></a><span class="lineno"> 1747</span>&#160;}</div>
<div class="line"><a name="l01748"></a><span class="lineno"> 1748</span>&#160;</div>
<div class="line"><a name="l01749"></a><span class="lineno"> 1749</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01750"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a7c522e70bc7f0c77cbce80f2b1def216"> 1750</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#abcd6e8cee331bbc49f9b36f5102a3ec3">ArrayvEBTree&lt;T&gt;::complUnionCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res){</div>
<div class="line"><a name="l01751"></a><span class="lineno"> 1751</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01752"></a><span class="lineno"> 1752</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01753"></a><span class="lineno"> 1753</span>&#160;        T* cvec = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01754"></a><span class="lineno"> 1754</span>&#160;        T* lim = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + res-&gt;<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01755"></a><span class="lineno"> 1755</span>&#160;</div>
<div class="line"><a name="l01756"></a><span class="lineno"> 1756</span>&#160;        <span class="keywordflow">if</span>(res-&gt;vEBTree&lt;T&gt;::<a class="code" href="classMultiLevelDirectlyAddressedSet.html#afed049ed58d442204d2e5d9c34491520" title="number of levels">height</a> &gt; 1){</div>
<div class="line"><a name="l01757"></a><span class="lineno"> 1757</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)res-&gt;vEBTree&lt;T&gt;::levels[1];</div>
<div class="line"><a name="l01758"></a><span class="lineno"> 1758</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01759"></a><span class="lineno"> 1759</span>&#160;                        <span class="keywordflow">if</span>((cvec[i] = ~avec[i] | ~bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01760"></a><span class="lineno"> 1760</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01761"></a><span class="lineno"> 1761</span>&#160;                }</div>
<div class="line"><a name="l01762"></a><span class="lineno"> 1762</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01763"></a><span class="lineno"> 1763</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++, cvec++){</div>
<div class="line"><a name="l01764"></a><span class="lineno"> 1764</span>&#160;                        *cvec = ~*avec &amp; ~*bvec;</div>
<div class="line"><a name="l01765"></a><span class="lineno"> 1765</span>&#160;                }</div>
<div class="line"><a name="l01766"></a><span class="lineno"> 1766</span>&#160;        }</div>
<div class="line"><a name="l01767"></a><span class="lineno"> 1767</span>&#160;}</div>
<div class="line"><a name="l01768"></a><span class="lineno"> 1768</span>&#160;</div>
<div class="line"><a name="l01769"></a><span class="lineno"> 1769</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01770"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#abc085acf38e16c1e2019dce63fc2a289"> 1770</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a946fde97c4c461900c6c1e5ff053d65b">ArrayvEBTree&lt;T&gt;::complDiffSimetricCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res){</div>
<div class="line"><a name="l01771"></a><span class="lineno"> 1771</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01772"></a><span class="lineno"> 1772</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01773"></a><span class="lineno"> 1773</span>&#160;        T* cvec = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01774"></a><span class="lineno"> 1774</span>&#160;        T* lim = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + res-&gt;<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01775"></a><span class="lineno"> 1775</span>&#160;</div>
<div class="line"><a name="l01776"></a><span class="lineno"> 1776</span>&#160;        <span class="keywordflow">if</span>(res-&gt;vEBTree&lt;T&gt;::<a class="code" href="classMultiLevelDirectlyAddressedSet.html#afed049ed58d442204d2e5d9c34491520" title="number of levels">height</a> &gt; 1){</div>
<div class="line"><a name="l01777"></a><span class="lineno"> 1777</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)res-&gt;vEBTree&lt;T&gt;::levels[1];</div>
<div class="line"><a name="l01778"></a><span class="lineno"> 1778</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01779"></a><span class="lineno"> 1779</span>&#160;                        <span class="keywordflow">if</span>((cvec[i] = ~avec[i] ^ ~bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01780"></a><span class="lineno"> 1780</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01781"></a><span class="lineno"> 1781</span>&#160;                }</div>
<div class="line"><a name="l01782"></a><span class="lineno"> 1782</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01783"></a><span class="lineno"> 1783</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++, cvec++){</div>
<div class="line"><a name="l01784"></a><span class="lineno"> 1784</span>&#160;                        *cvec = ~*avec ^ ~*bvec;</div>
<div class="line"><a name="l01785"></a><span class="lineno"> 1785</span>&#160;                }</div>
<div class="line"><a name="l01786"></a><span class="lineno"> 1786</span>&#160;        }</div>
<div class="line"><a name="l01787"></a><span class="lineno"> 1787</span>&#160;}</div>
<div class="line"><a name="l01788"></a><span class="lineno"> 1788</span>&#160;</div>
<div class="line"><a name="l01789"></a><span class="lineno"> 1789</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01790"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#afeff9966ce76876459c2af22d8cbaacf"> 1790</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#a1a4c451e61971b4493bb9daefc5b559c">ArrayvEBTree&lt;T&gt;::complIntersecCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res){</div>
<div class="line"><a name="l01791"></a><span class="lineno"> 1791</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01792"></a><span class="lineno"> 1792</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01793"></a><span class="lineno"> 1793</span>&#160;        T* cvec = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01794"></a><span class="lineno"> 1794</span>&#160;        T* lim = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + res-&gt;<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01795"></a><span class="lineno"> 1795</span>&#160;</div>
<div class="line"><a name="l01796"></a><span class="lineno"> 1796</span>&#160;        <span class="keywordflow">if</span>(res-&gt;vEBTree&lt;T&gt;::<a class="code" href="classMultiLevelDirectlyAddressedSet.html#afed049ed58d442204d2e5d9c34491520" title="number of levels">height</a> &gt; 1){</div>
<div class="line"><a name="l01797"></a><span class="lineno"> 1797</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)res-&gt;vEBTree&lt;T&gt;::levels[1];</div>
<div class="line"><a name="l01798"></a><span class="lineno"> 1798</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01799"></a><span class="lineno"> 1799</span>&#160;                        <span class="keywordflow">if</span>((cvec[i] = ~avec[i] &amp; ~bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01800"></a><span class="lineno"> 1800</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01801"></a><span class="lineno"> 1801</span>&#160;                }</div>
<div class="line"><a name="l01802"></a><span class="lineno"> 1802</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01803"></a><span class="lineno"> 1803</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++, cvec++){</div>
<div class="line"><a name="l01804"></a><span class="lineno"> 1804</span>&#160;                        *cvec = ~*avec &amp; ~*bvec;</div>
<div class="line"><a name="l01805"></a><span class="lineno"> 1805</span>&#160;                }</div>
<div class="line"><a name="l01806"></a><span class="lineno"> 1806</span>&#160;        }</div>
<div class="line"><a name="l01807"></a><span class="lineno"> 1807</span>&#160;}</div>
<div class="line"><a name="l01808"></a><span class="lineno"> 1808</span>&#160;</div>
<div class="line"><a name="l01809"></a><span class="lineno"> 1809</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01810"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a49753f3164f8aa4c8a6e95befc9a201f"> 1810</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html#aab6c709db21c6d3f635add33ef487858">ArrayvEBTree&lt;T&gt;::complDiffCompl</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* v, <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* res){</div>
<div class="line"><a name="l01811"></a><span class="lineno"> 1811</span>&#160;        T* avec = <a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01812"></a><span class="lineno"> 1812</span>&#160;        T* bvec = v-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01813"></a><span class="lineno"> 1813</span>&#160;        T* cvec = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a>;</div>
<div class="line"><a name="l01814"></a><span class="lineno"> 1814</span>&#160;        T* lim = res-&gt;<a class="code" href="classArrayvEBTree.html#a44541f1c8279c823b1bbd76d1e11a525" title="the array of words">vector</a> + res-&gt;<a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>;</div>
<div class="line"><a name="l01815"></a><span class="lineno"> 1815</span>&#160;</div>
<div class="line"><a name="l01816"></a><span class="lineno"> 1816</span>&#160;        <span class="keywordflow">if</span>(res-&gt;vEBTree&lt;T&gt;::<a class="code" href="classMultiLevelDirectlyAddressedSet.html#afed049ed58d442204d2e5d9c34491520" title="number of levels">height</a> &gt; 1){</div>
<div class="line"><a name="l01817"></a><span class="lineno"> 1817</span>&#160;                <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* <a class="code" href="Heap_8hpp.html#a78217c3cbec4a2eedc47a599c01c434d">up</a> = (<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>*)res-&gt;vEBTree&lt;T&gt;::levels[1];</div>
<div class="line"><a name="l01818"></a><span class="lineno"> 1818</span>&#160;                <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0 ; i &lt; <a class="code" href="classArrayvEBTree.html#acbc65f52e15c54d4905274ae00de36e6" title="the size of vector">vectorsz</a>; i++){</div>
<div class="line"><a name="l01819"></a><span class="lineno"> 1819</span>&#160;                        <span class="keywordflow">if</span>((cvec[i] = ~avec[i] &amp; bvec[i]) == 0)up-&gt;<a class="code" href="classArrayvEBTree.html#a46e7137bf680127a8e392888f4d267c4" title="Add the specified element to the complement, removing it from the set.">toCompl</a>(i);</div>
<div class="line"><a name="l01820"></a><span class="lineno"> 1820</span>&#160;                        <span class="keywordflow">else</span> up-&gt;<a class="code" href="classArrayvEBTree.html#aeded9a0018a32f5fce4c941d6e9a05c0" title="Add the specified element to the set, removing it from the complement.">toSet</a>(i);</div>
<div class="line"><a name="l01821"></a><span class="lineno"> 1821</span>&#160;                }</div>
<div class="line"><a name="l01822"></a><span class="lineno"> 1822</span>&#160;        }<span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01823"></a><span class="lineno"> 1823</span>&#160;                <span class="keywordflow">for</span>(; avec &lt; lim; avec++, bvec++, cvec++){</div>
<div class="line"><a name="l01824"></a><span class="lineno"> 1824</span>&#160;                        *cvec = ~*avec &amp; *bvec;</div>
<div class="line"><a name="l01825"></a><span class="lineno"> 1825</span>&#160;                }</div>
<div class="line"><a name="l01826"></a><span class="lineno"> 1826</span>&#160;        }</div>
<div class="line"><a name="l01827"></a><span class="lineno"> 1827</span>&#160;}</div>
<div class="line"><a name="l01828"></a><span class="lineno"> 1828</span>&#160;</div>
<div class="line"><a name="l01829"></a><span class="lineno"> 1829</span>&#160;<span class="comment">//Iterator</span></div>
<div class="line"><a name="l01830"></a><span class="lineno"> 1830</span>&#160;</div>
<div class="line"><a name="l01831"></a><span class="lineno"> 1831</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01832"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#ab9cb1d6317d3d5228aa5a63fbb66e740"> 1832</a></span>&#160;<a class="code" href="classDirectlyAddressedSet_1_1Iterator.html#acc93f949a845d47f30ee6f6c75334577">ArrayvEBTree&lt;T&gt;::Iterator::Iterator</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* t){</div>
<div class="line"><a name="l01833"></a><span class="lineno"> 1833</span>&#160;        <span class="comment">//alocate memory</span></div>
<div class="line"><a name="l01834"></a><span class="lineno"> 1834</span>&#160;        <a class="code" href="classArrayvEBTree_1_1Iterator.html#a0fb963da5cbed1f6648fb13701570290" title="a copy of the target instance of vEBTree&lt;T&gt;::height.">ht</a> = t-&gt;vEBTree&lt;T&gt;<a class="code" href="classMultiLevelDirectlyAddressedSet.html#afed049ed58d442204d2e5d9c34491520" title="number of levels">::height</a>;</div>
<div class="line"><a name="l01835"></a><span class="lineno"> 1835</span>&#160;        <a class="code" href="classArrayvEBTree_1_1Iterator.html#a5bdb72999e0e254acfd4c7e156244a94">logb</a> = t-&gt;vEBTree&lt;T&gt;<a class="code" href="classArrayvEBTree_1_1Iterator.html#a5bdb72999e0e254acfd4c7e156244a94">::logb</a>;</div>
<div class="line"><a name="l01836"></a><span class="lineno"> 1836</span>&#160;        <a class="code" href="classArrayvEBTree_1_1Iterator.html#a9a8f467005b0c38a472531fa2f433807" title="a copy to the levels in the tree.">levels</a> = <span class="keyword">new</span> T*[<a class="code" href="classArrayvEBTree_1_1Iterator.html#a0fb963da5cbed1f6648fb13701570290" title="a copy of the target instance of vEBTree&lt;T&gt;::height.">ht</a>];</div>
<div class="line"><a name="l01837"></a><span class="lineno"> 1837</span>&#160;        <a class="code" href="classArrayvEBTree_1_1Iterator.html#a2a71acb3fd39b88fe2ff3ed030fc939a">lims</a> = <span class="keyword">new</span> <span class="keywordtype">long</span>[<a class="code" href="classArrayvEBTree_1_1Iterator.html#a0fb963da5cbed1f6648fb13701570290" title="a copy of the target instance of vEBTree&lt;T&gt;::height.">ht</a>];</div>
<div class="line"><a name="l01838"></a><span class="lineno"> 1838</span>&#160;        <a class="code" href="classArrayvEBTree_1_1Iterator.html#a125c36721f010b692db267c0906918a9" title="position inside the word, in each level.">slides</a> = <span class="keyword">new</span> <span class="keywordtype">long</span>[<a class="code" href="classArrayvEBTree_1_1Iterator.html#a0fb963da5cbed1f6648fb13701570290" title="a copy of the target instance of vEBTree&lt;T&gt;::height.">ht</a>];</div>
<div class="line"><a name="l01839"></a><span class="lineno"> 1839</span>&#160;        <a class="code" href="classArrayvEBTree_1_1Iterator.html#ac4510f918b6a84a1bb6aa8affabc6943" title="indexes, in each level of the words enumerated.">idxs</a> = <span class="keyword">new</span> <span class="keywordtype">long</span>[<a class="code" href="classArrayvEBTree_1_1Iterator.html#a0fb963da5cbed1f6648fb13701570290" title="a copy of the target instance of vEBTree&lt;T&gt;::height.">ht</a>];</div>
<div class="line"><a name="l01840"></a><span class="lineno"> 1840</span>&#160;</div>
<div class="line"><a name="l01841"></a><span class="lineno"> 1841</span>&#160;        <span class="comment">//copy the reference to all the levels</span></div>
<div class="line"><a name="l01842"></a><span class="lineno"> 1842</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; <a class="code" href="classArrayvEBTree_1_1Iterator.html#a0fb963da5cbed1f6648fb13701570290" title="a copy of the target instance of vEBTree&lt;T&gt;::height.">ht</a>; i++){</div>
<div class="line"><a name="l01843"></a><span class="lineno"> 1843</span>&#160;                <a class="code" href="classArrayvEBTree_1_1Iterator.html#a9a8f467005b0c38a472531fa2f433807" title="a copy to the levels in the tree.">levels</a>[i] = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree</a>*)t-&gt;vEBTree&lt;T&gt;::<a class="code" href="classArrayvEBTree_1_1Iterator.html#a9a8f467005b0c38a472531fa2f433807" title="a copy to the levels in the tree.">levels</a>[i])-&gt;vector;</div>
<div class="line"><a name="l01844"></a><span class="lineno"> 1844</span>&#160;                <a class="code" href="classArrayvEBTree_1_1Iterator.html#a2a71acb3fd39b88fe2ff3ed030fc939a">lims</a>[i] = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree</a>*)t-&gt;vEBTree&lt;T&gt;::<a class="code" href="classArrayvEBTree_1_1Iterator.html#a9a8f467005b0c38a472531fa2f433807" title="a copy to the levels in the tree.">levels</a>[i])-&gt;vectorsz;</div>
<div class="line"><a name="l01845"></a><span class="lineno"> 1845</span>&#160;        }</div>
<div class="line"><a name="l01846"></a><span class="lineno"> 1846</span>&#160;</div>
<div class="line"><a name="l01847"></a><span class="lineno"> 1847</span>&#160;        <span class="comment">//copy same inner variables</span></div>
<div class="line"><a name="l01848"></a><span class="lineno"> 1848</span>&#160;        <a class="code" href="classArrayvEBTree_1_1Iterator.html#adfe8b2a949d1ccf7e6dc0d32bf790e45" title="the size in bits of a word">word_size</a> = t-&gt;<a class="code" href="classBitTools.html#acf7ff71b956d4be998a44c46ad2aafa2" title="number of bits of a word">word_size</a>;</div>
<div class="line"><a name="l01849"></a><span class="lineno"> 1849</span>&#160;        <a class="code" href="classArrayvEBTree_1_1Iterator.html#ae8f6d0362b9667e5b30ca6e113ec0703" title="the size of the vEBTree that is being enumerate, its a simple copy of the value t-&gt;size().">size</a> = t-&gt;<a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>();</div>
<div class="line"><a name="l01850"></a><span class="lineno"> 1850</span>&#160;        <a class="code" href="classArrayvEBTree_1_1Iterator.html#a8a331e1f4c618a0f03b5c76cd43c87e8" title="the current element in the enumeration">current</a> = 0;</div>
<div class="line"><a name="l01851"></a><span class="lineno"> 1851</span>&#160;}</div>
<div class="line"><a name="l01852"></a><span class="lineno"> 1852</span>&#160;</div>
<div class="line"><a name="l01853"></a><span class="lineno"> 1853</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01854"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#a680777939650bf1bbe7acb53e4f82ab4"> 1854</a></span>&#160;<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;::Iterator::~Iterator</a>(){</div>
<div class="line"><a name="l01855"></a><span class="lineno"> 1855</span>&#160;        <span class="comment">//clean memory</span></div>
<div class="line"><a name="l01856"></a><span class="lineno"> 1856</span>&#160;        <span class="keyword">delete</span> levels;</div>
<div class="line"><a name="l01857"></a><span class="lineno"> 1857</span>&#160;        <span class="keyword">delete</span> slides;</div>
<div class="line"><a name="l01858"></a><span class="lineno"> 1858</span>&#160;        <span class="keyword">delete</span> idxs;</div>
<div class="line"><a name="l01859"></a><span class="lineno"> 1859</span>&#160;}</div>
<div class="line"><a name="l01860"></a><span class="lineno"> 1860</span>&#160;</div>
<div class="line"><a name="l01861"></a><span class="lineno"> 1861</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01862"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#ad39278d88dd0d2f0cad2adfe84b4019c"> 1862</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">ArrayvEBTree&lt;T&gt;::Iterator::bitLeast</a>(<span class="keywordtype">long</span> idx, <span class="keywordtype">long</span> slide, <span class="keywordtype">long</span> h){</div>
<div class="line"><a name="l01863"></a><span class="lineno"> 1863</span>&#160;        <span class="keywordflow">return</span> builtinLeast&lt;T&gt;(levels[h][idx] &amp; <a class="code" href="classBitTools.html#a282ef6cebdba59e5ca064290ec898d10">posmasksimp</a>[slide]);</div>
<div class="line"><a name="l01864"></a><span class="lineno"> 1864</span>&#160;}</div>
<div class="line"><a name="l01865"></a><span class="lineno"> 1865</span>&#160;</div>
<div class="line"><a name="l01866"></a><span class="lineno"> 1866</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01867"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#a17bf7e111b3fdb99bc2736f6ebdb160e"> 1867</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;::Iterator::start</a>(){</div>
<div class="line"><a name="l01868"></a><span class="lineno"> 1868</span>&#160;        <span class="comment">//initialize the variables</span></div>
<div class="line"><a name="l01869"></a><span class="lineno"> 1869</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; ht; i++){</div>
<div class="line"><a name="l01870"></a><span class="lineno"> 1870</span>&#160;                slides[i] = 0;</div>
<div class="line"><a name="l01871"></a><span class="lineno"> 1871</span>&#160;                idxs[i] = 0;</div>
<div class="line"><a name="l01872"></a><span class="lineno"> 1872</span>&#160;        }</div>
<div class="line"><a name="l01873"></a><span class="lineno"> 1873</span>&#160;</div>
<div class="line"><a name="l01874"></a><span class="lineno"> 1874</span>&#160;        <span class="comment">//look for the first</span></div>
<div class="line"><a name="l01875"></a><span class="lineno"> 1875</span>&#160;        <span class="keywordtype">long</span> h = ht - 1 ;</div>
<div class="line"><a name="l01876"></a><span class="lineno"> 1876</span>&#160;        <span class="keywordtype">long</span> bit ;</div>
<div class="line"><a name="l01877"></a><span class="lineno"> 1877</span>&#160;        idxs[h] = -1;</div>
<div class="line"><a name="l01878"></a><span class="lineno"> 1878</span>&#160;        <span class="comment">//search in the higher level</span></div>
<div class="line"><a name="l01879"></a><span class="lineno"> 1879</span>&#160;        <span class="keywordflow">do</span>{</div>
<div class="line"><a name="l01880"></a><span class="lineno"> 1880</span>&#160;                idxs[h]++;</div>
<div class="line"><a name="l01881"></a><span class="lineno"> 1881</span>&#160;                bit = <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">bitLeast</a>(idxs[h], slides[h], h);</div>
<div class="line"><a name="l01882"></a><span class="lineno"> 1882</span>&#160;        }<span class="keywordflow">while</span>(bit == -1 &amp;&amp; idxs[h] &lt; lims[h]);</div>
<div class="line"><a name="l01883"></a><span class="lineno"> 1883</span>&#160;</div>
<div class="line"><a name="l01884"></a><span class="lineno"> 1884</span>&#160;        <span class="comment">//if not found</span></div>
<div class="line"><a name="l01885"></a><span class="lineno"> 1885</span>&#160;        <span class="keywordflow">if</span>(idxs[h] == lims[h])</div>
<div class="line"><a name="l01886"></a><span class="lineno"> 1886</span>&#160;                current = <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a> + 1;</div>
<div class="line"><a name="l01887"></a><span class="lineno"> 1887</span>&#160;        <span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01888"></a><span class="lineno"> 1888</span>&#160;                <span class="comment">//down in the tree</span></div>
<div class="line"><a name="l01889"></a><span class="lineno"> 1889</span>&#160;                slides[h] = bit;</div>
<div class="line"><a name="l01890"></a><span class="lineno"> 1890</span>&#160;                <span class="keywordflow">for</span>(; h &gt; 0; h--) {</div>
<div class="line"><a name="l01891"></a><span class="lineno"> 1891</span>&#160;                        idxs[h-1] = (idxs[h] &lt;&lt; <a class="code" href="classBitTools.html#a0fe1acc3156ee09ecd71da226484f638" title="logarithmic of the size, in bits, of a word">logb</a>) + slides[h];</div>
<div class="line"><a name="l01892"></a><span class="lineno"> 1892</span>&#160;                        <span class="keywordflow">if</span>(idxs[h-1] &gt;= lims[h-1]){</div>
<div class="line"><a name="l01893"></a><span class="lineno"> 1893</span>&#160;                                current = -1;</div>
<div class="line"><a name="l01894"></a><span class="lineno"> 1894</span>&#160;                                <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l01895"></a><span class="lineno"> 1895</span>&#160;                        }</div>
<div class="line"><a name="l01896"></a><span class="lineno"> 1896</span>&#160;                        slides[h-1] = <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">bitLeast</a>(idxs[h-1], 0, h-1);</div>
<div class="line"><a name="l01897"></a><span class="lineno"> 1897</span>&#160;                }</div>
<div class="line"><a name="l01898"></a><span class="lineno"> 1898</span>&#160;                current = (idxs[0] &lt;&lt; <a class="code" href="classBitTools.html#a0fe1acc3156ee09ecd71da226484f638" title="logarithmic of the size, in bits, of a word">logb</a>) + slides[0];</div>
<div class="line"><a name="l01899"></a><span class="lineno"> 1899</span>&#160;        }</div>
<div class="line"><a name="l01900"></a><span class="lineno"> 1900</span>&#160;}</div>
<div class="line"><a name="l01901"></a><span class="lineno"> 1901</span>&#160;</div>
<div class="line"><a name="l01902"></a><span class="lineno"> 1902</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01903"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#a9a5d39b750892c7451ce46c50ad00172"> 1903</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;::Iterator::restart</a>(){</div>
<div class="line"><a name="l01904"></a><span class="lineno"> 1904</span>&#160;        start();</div>
<div class="line"><a name="l01905"></a><span class="lineno"> 1905</span>&#160;}</div>
<div class="line"><a name="l01906"></a><span class="lineno"> 1906</span>&#160;</div>
<div class="line"><a name="l01907"></a><span class="lineno"> 1907</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01908"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#aa0d4c6de3f7ee3ab07bde1c1934df660"> 1908</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;::Iterator::restartFrom</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l01909"></a><span class="lineno"> 1909</span>&#160;        <span class="comment">//initialize</span></div>
<div class="line"><a name="l01910"></a><span class="lineno"> 1910</span>&#160;        start();</div>
<div class="line"><a name="l01911"></a><span class="lineno"> 1911</span>&#160;        <span class="keywordflow">if</span>(i &gt;= lims[0]) current = <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a> + 1;</div>
<div class="line"><a name="l01912"></a><span class="lineno"> 1912</span>&#160;        <span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01913"></a><span class="lineno"> 1913</span>&#160;                <span class="comment">//walk untill pass the especified position</span></div>
<div class="line"><a name="l01914"></a><span class="lineno"> 1914</span>&#160;                <span class="keywordflow">while</span>(current &lt; i )next();</div>
<div class="line"><a name="l01915"></a><span class="lineno"> 1915</span>&#160;        }</div>
<div class="line"><a name="l01916"></a><span class="lineno"> 1916</span>&#160;}</div>
<div class="line"><a name="l01917"></a><span class="lineno"> 1917</span>&#160;</div>
<div class="line"><a name="l01918"></a><span class="lineno"> 1918</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01919"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#a5f87c5e123eca5fa27bf58bb670ee88c"> 1919</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;::Iterator::hasNext</a>(){</div>
<div class="line"><a name="l01920"></a><span class="lineno"> 1920</span>&#160;        <span class="keywordflow">return</span> current &lt; <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>;</div>
<div class="line"><a name="l01921"></a><span class="lineno"> 1921</span>&#160;}</div>
<div class="line"><a name="l01922"></a><span class="lineno"> 1922</span>&#160;</div>
<div class="line"><a name="l01923"></a><span class="lineno"> 1923</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01924"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1Iterator.html#a15293b0382355e96ae1b45022937e535"> 1924</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;::Iterator::next</a>(){</div>
<div class="line"><a name="l01925"></a><span class="lineno"> 1925</span>&#160;        <span class="keywordtype">long</span> ret = current;</div>
<div class="line"><a name="l01926"></a><span class="lineno"> 1926</span>&#160;        <span class="keywordtype">long</span> h = 0;</div>
<div class="line"><a name="l01927"></a><span class="lineno"> 1927</span>&#160;        <span class="keywordtype">long</span> bit = 0;</div>
<div class="line"><a name="l01928"></a><span class="lineno"> 1928</span>&#160;        <span class="comment">//look in the bottom level</span></div>
<div class="line"><a name="l01929"></a><span class="lineno"> 1929</span>&#160;        <span class="keywordflow">if</span>(++slides[h] &gt;= <a class="code" href="classBitTools.html#acf7ff71b956d4be998a44c46ad2aafa2" title="number of bits of a word">word_size</a>){</div>
<div class="line"><a name="l01930"></a><span class="lineno"> 1930</span>&#160;                slides[h] = 0;</div>
<div class="line"><a name="l01931"></a><span class="lineno"> 1931</span>&#160;                <span class="keywordflow">if</span>(++idxs[h] &gt;= lims[h]){</div>
<div class="line"><a name="l01932"></a><span class="lineno"> 1932</span>&#160;                        current = <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>+1;</div>
<div class="line"><a name="l01933"></a><span class="lineno"> 1933</span>&#160;                        <span class="keywordflow">return</span> ret;</div>
<div class="line"><a name="l01934"></a><span class="lineno"> 1934</span>&#160;                }</div>
<div class="line"><a name="l01935"></a><span class="lineno"> 1935</span>&#160;        }</div>
<div class="line"><a name="l01936"></a><span class="lineno"> 1936</span>&#160;        bit = <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">bitLeast</a>(idxs[h], slides[h], h);</div>
<div class="line"><a name="l01937"></a><span class="lineno"> 1937</span>&#160;        <span class="comment">//going up in the tree</span></div>
<div class="line"><a name="l01938"></a><span class="lineno"> 1938</span>&#160;        <span class="keywordflow">while</span>(bit == -1 &amp;&amp; h &lt; ht - 1 ){</div>
<div class="line"><a name="l01939"></a><span class="lineno"> 1939</span>&#160;                h++;</div>
<div class="line"><a name="l01940"></a><span class="lineno"> 1940</span>&#160;                <span class="keywordflow">if</span>(++slides[h] &gt;= <a class="code" href="classBitTools.html#acf7ff71b956d4be998a44c46ad2aafa2" title="number of bits of a word">word_size</a>){</div>
<div class="line"><a name="l01941"></a><span class="lineno"> 1941</span>&#160;                        slides[h] = 0;</div>
<div class="line"><a name="l01942"></a><span class="lineno"> 1942</span>&#160;                        <span class="keywordflow">if</span>(++idxs[h] &gt;= lims[h]){</div>
<div class="line"><a name="l01943"></a><span class="lineno"> 1943</span>&#160;                                current = <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>+1;</div>
<div class="line"><a name="l01944"></a><span class="lineno"> 1944</span>&#160;                                <span class="keywordflow">return</span> ret;</div>
<div class="line"><a name="l01945"></a><span class="lineno"> 1945</span>&#160;                        }</div>
<div class="line"><a name="l01946"></a><span class="lineno"> 1946</span>&#160;                }</div>
<div class="line"><a name="l01947"></a><span class="lineno"> 1947</span>&#160;                bit = <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">bitLeast</a>(idxs[h], slides[h], h);</div>
<div class="line"><a name="l01948"></a><span class="lineno"> 1948</span>&#160;        }</div>
<div class="line"><a name="l01949"></a><span class="lineno"> 1949</span>&#160;</div>
<div class="line"><a name="l01950"></a><span class="lineno"> 1950</span>&#160;        <span class="comment">//look in the higher level</span></div>
<div class="line"><a name="l01951"></a><span class="lineno"> 1951</span>&#160;        <span class="keywordflow">while</span>(bit==-1 &amp;&amp; idxs[h]++ &lt; lims[h] - 1){</div>
<div class="line"><a name="l01952"></a><span class="lineno"> 1952</span>&#160;                bit = <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">bitLeast</a>(idxs[h], slides[h], h);</div>
<div class="line"><a name="l01953"></a><span class="lineno"> 1953</span>&#160;        }</div>
<div class="line"><a name="l01954"></a><span class="lineno"> 1954</span>&#160;        <span class="comment">//if not found</span></div>
<div class="line"><a name="l01955"></a><span class="lineno"> 1955</span>&#160;        <span class="keywordflow">if</span>(idxs[h] == lims[h]) current = <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a> + 1 ;</div>
<div class="line"><a name="l01956"></a><span class="lineno"> 1956</span>&#160;        <span class="keywordflow">else</span>{</div>
<div class="line"><a name="l01957"></a><span class="lineno"> 1957</span>&#160;                <span class="comment">//going down in the tree</span></div>
<div class="line"><a name="l01958"></a><span class="lineno"> 1958</span>&#160;                slides[h] = bit;</div>
<div class="line"><a name="l01959"></a><span class="lineno"> 1959</span>&#160;                <span class="keywordflow">for</span>(; h &gt; 0; h--) {</div>
<div class="line"><a name="l01960"></a><span class="lineno"> 1960</span>&#160;                        idxs[h-1] = (idxs[h] &lt;&lt; <a class="code" href="classBitTools.html#a0fe1acc3156ee09ecd71da226484f638" title="logarithmic of the size, in bits, of a word">logb</a>) + slides[h];</div>
<div class="line"><a name="l01961"></a><span class="lineno"> 1961</span>&#160;                        <span class="keywordflow">if</span>(idxs[h-1] &gt;= lims[h-1]){</div>
<div class="line"><a name="l01962"></a><span class="lineno"> 1962</span>&#160;                                current = -1;</div>
<div class="line"><a name="l01963"></a><span class="lineno"> 1963</span>&#160;                                <span class="keywordflow">return</span> ret;</div>
<div class="line"><a name="l01964"></a><span class="lineno"> 1964</span>&#160;                        }</div>
<div class="line"><a name="l01965"></a><span class="lineno"> 1965</span>&#160;                        slides[h-1] = <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">bitLeast</a>(idxs[h-1], 0, h-1);</div>
<div class="line"><a name="l01966"></a><span class="lineno"> 1966</span>&#160;                }</div>
<div class="line"><a name="l01967"></a><span class="lineno"> 1967</span>&#160;                current = (idxs[0] &lt;&lt; <a class="code" href="classBitTools.html#a0fe1acc3156ee09ecd71da226484f638" title="logarithmic of the size, in bits, of a word">logb</a>) + slides[0];</div>
<div class="line"><a name="l01968"></a><span class="lineno"> 1968</span>&#160;        }</div>
<div class="line"><a name="l01969"></a><span class="lineno"> 1969</span>&#160;        <span class="keywordflow">return</span> ret;</div>
<div class="line"><a name="l01970"></a><span class="lineno"> 1970</span>&#160;}</div>
<div class="line"><a name="l01971"></a><span class="lineno"> 1971</span>&#160;</div>
<div class="line"><a name="l01972"></a><span class="lineno"> 1972</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01973"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#af2d018d04016ac88f295998f3c60eb1e"> 1973</a></span>&#160;<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;::FilterIterator::FilterIterator</a>(<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>* t, <a class="code" href="classDirectlyAddressedSet.html">DirectlyAddressedSet&lt;long&gt;</a>* filter){</div>
<div class="line"><a name="l01974"></a><span class="lineno"> 1974</span>&#160;        this-&gt;filter = filter;</div>
<div class="line"><a name="l01975"></a><span class="lineno"> 1975</span>&#160;        ht = t-&gt;vEBTree&lt;T&gt;<a class="code" href="classMultiLevelDirectlyAddressedSet.html#afed049ed58d442204d2e5d9c34491520" title="number of levels">::height</a>;</div>
<div class="line"><a name="l01976"></a><span class="lineno"> 1976</span>&#160;        <a class="code" href="classBitTools.html#a0fe1acc3156ee09ecd71da226484f638" title="logarithmic of the size, in bits, of a word">logb</a> = t-&gt;vEBTree&lt;T&gt;<a class="code" href="classBitTools.html#a0fe1acc3156ee09ecd71da226484f638" title="logarithmic of the size, in bits, of a word">::logb</a>;</div>
<div class="line"><a name="l01977"></a><span class="lineno"> 1977</span>&#160;        levels = <span class="keyword">new</span> T*[ht];</div>
<div class="line"><a name="l01978"></a><span class="lineno"> 1978</span>&#160;        lims = <span class="keyword">new</span> <span class="keywordtype">long</span>[ht];</div>
<div class="line"><a name="l01979"></a><span class="lineno"> 1979</span>&#160;        slides = <span class="keyword">new</span> <span class="keywordtype">long</span>[ht];</div>
<div class="line"><a name="l01980"></a><span class="lineno"> 1980</span>&#160;        idxs = <span class="keyword">new</span> <span class="keywordtype">long</span>[ht];</div>
<div class="line"><a name="l01981"></a><span class="lineno"> 1981</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; ht; i++){</div>
<div class="line"><a name="l01982"></a><span class="lineno"> 1982</span>&#160;                levels[i] = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree</a>*)t-&gt;vEBTree&lt;T&gt;::levels[i])-&gt;vector;</div>
<div class="line"><a name="l01983"></a><span class="lineno"> 1983</span>&#160;                lims[i] = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree</a>*)t-&gt;vEBTree&lt;T&gt;::levels[i])-&gt;vectorsz;</div>
<div class="line"><a name="l01984"></a><span class="lineno"> 1984</span>&#160;        }</div>
<div class="line"><a name="l01985"></a><span class="lineno"> 1985</span>&#160;        <a class="code" href="classBitTools.html#acf7ff71b956d4be998a44c46ad2aafa2" title="number of bits of a word">word_size</a> = t-&gt;<a class="code" href="classBitTools.html#acf7ff71b956d4be998a44c46ad2aafa2" title="number of bits of a word">word_size</a>;</div>
<div class="line"><a name="l01986"></a><span class="lineno"> 1986</span>&#160;        <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a> = t-&gt;<a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>();</div>
<div class="line"><a name="l01987"></a><span class="lineno"> 1987</span>&#160;        current = 0;</div>
<div class="line"><a name="l01988"></a><span class="lineno"> 1988</span>&#160;}</div>
<div class="line"><a name="l01989"></a><span class="lineno"> 1989</span>&#160;</div>
<div class="line"><a name="l01990"></a><span class="lineno"> 1990</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01991"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#ad870d22713999534a7c8546328df53d0"> 1991</a></span>&#160;<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;::FilterIterator::~FilterIterator</a>(){</div>
<div class="line"><a name="l01992"></a><span class="lineno"> 1992</span>&#160;        <span class="keyword">delete</span> levels;</div>
<div class="line"><a name="l01993"></a><span class="lineno"> 1993</span>&#160;        <span class="keyword">delete</span> slides;</div>
<div class="line"><a name="l01994"></a><span class="lineno"> 1994</span>&#160;        <span class="keyword">delete</span> idxs;</div>
<div class="line"><a name="l01995"></a><span class="lineno"> 1995</span>&#160;}</div>
<div class="line"><a name="l01996"></a><span class="lineno"> 1996</span>&#160;</div>
<div class="line"><a name="l01997"></a><span class="lineno"> 1997</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l01998"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a09580d1762d868baf9c7560b0dad05e2"> 1998</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">ArrayvEBTree&lt;T&gt;::FilterIterator::bitLeast</a>(<span class="keywordtype">long</span> idx, <span class="keywordtype">long</span> slide, <span class="keywordtype">long</span> h){</div>
<div class="line"><a name="l01999"></a><span class="lineno"> 1999</span>&#160;        <span class="keywordflow">return</span> builtinLeast&lt;T&gt;(levels[h][idx] &amp; <a class="code" href="classBitTools.html#a282ef6cebdba59e5ca064290ec898d10">posmasksimp</a>[slide]);</div>
<div class="line"><a name="l02000"></a><span class="lineno"> 2000</span>&#160;}</div>
<div class="line"><a name="l02001"></a><span class="lineno"> 2001</span>&#160;</div>
<div class="line"><a name="l02002"></a><span class="lineno"> 2002</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l02003"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a863e95227e516d893ab343f4c2a848ba"> 2003</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;::FilterIterator::start</a>(){</div>
<div class="line"><a name="l02004"></a><span class="lineno"> 2004</span>&#160;        <span class="keywordflow">for</span>(<span class="keywordtype">long</span> i = 0; i &lt; ht; i++){</div>
<div class="line"><a name="l02005"></a><span class="lineno"> 2005</span>&#160;                slides[i] = 0;</div>
<div class="line"><a name="l02006"></a><span class="lineno"> 2006</span>&#160;                idxs[0] = 0;</div>
<div class="line"><a name="l02007"></a><span class="lineno"> 2007</span>&#160;        }</div>
<div class="line"><a name="l02008"></a><span class="lineno"> 2008</span>&#160;</div>
<div class="line"><a name="l02009"></a><span class="lineno"> 2009</span>&#160;        <span class="comment">//look for the first</span></div>
<div class="line"><a name="l02010"></a><span class="lineno"> 2010</span>&#160;        <span class="keywordtype">long</span> h = ht;</div>
<div class="line"><a name="l02011"></a><span class="lineno"> 2011</span>&#160;        <span class="keywordtype">long</span> bit ;</div>
<div class="line"><a name="l02012"></a><span class="lineno"> 2012</span>&#160;</div>
<div class="line"><a name="l02013"></a><span class="lineno"> 2013</span>&#160;        <span class="keywordflow">do</span>{</div>
<div class="line"><a name="l02014"></a><span class="lineno"> 2014</span>&#160;                bit = <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">bitLeast</a>(idxs[h]++, slides[h], h);</div>
<div class="line"><a name="l02015"></a><span class="lineno"> 2015</span>&#160;        }<span class="keywordflow">while</span>(bit==-1 &amp;&amp; idxs[h] &lt; lims[h]);</div>
<div class="line"><a name="l02016"></a><span class="lineno"> 2016</span>&#160;</div>
<div class="line"><a name="l02017"></a><span class="lineno"> 2017</span>&#160;        <span class="keywordflow">if</span>(idxs[h] == lims[h])</div>
<div class="line"><a name="l02018"></a><span class="lineno"> 2018</span>&#160;                current = <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a> + 1;</div>
<div class="line"><a name="l02019"></a><span class="lineno"> 2019</span>&#160;        <span class="keywordflow">else</span>{</div>
<div class="line"><a name="l02020"></a><span class="lineno"> 2020</span>&#160;                slides[h] = bit;</div>
<div class="line"><a name="l02021"></a><span class="lineno"> 2021</span>&#160;                <span class="keywordflow">for</span>(; h &gt; 0; h--) {</div>
<div class="line"><a name="l02022"></a><span class="lineno"> 2022</span>&#160;                        idxs[h-1] = (idxs[h] &lt;&lt; <a class="code" href="classBitTools.html#a0fe1acc3156ee09ecd71da226484f638" title="logarithmic of the size, in bits, of a word">logb</a>) + slides[h];</div>
<div class="line"><a name="l02023"></a><span class="lineno"> 2023</span>&#160;                        <span class="keywordflow">if</span>(idxs[h-1] &gt;= lims[h-1]){</div>
<div class="line"><a name="l02024"></a><span class="lineno"> 2024</span>&#160;                                current = -1;</div>
<div class="line"><a name="l02025"></a><span class="lineno"> 2025</span>&#160;                                <span class="keywordflow">return</span>;</div>
<div class="line"><a name="l02026"></a><span class="lineno"> 2026</span>&#160;                        }</div>
<div class="line"><a name="l02027"></a><span class="lineno"> 2027</span>&#160;                        slides[h-1] = <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">bitLeast</a>(idxs[h-1], 0, h-1);</div>
<div class="line"><a name="l02028"></a><span class="lineno"> 2028</span>&#160;                }</div>
<div class="line"><a name="l02029"></a><span class="lineno"> 2029</span>&#160;                current = (idxs[0] &lt;&lt; <a class="code" href="classBitTools.html#a0fe1acc3156ee09ecd71da226484f638" title="logarithmic of the size, in bits, of a word">logb</a>) + slides[0];</div>
<div class="line"><a name="l02030"></a><span class="lineno"> 2030</span>&#160;                <span class="keywordflow">if</span>(filter-&gt;isInCompl(current))next();</div>
<div class="line"><a name="l02031"></a><span class="lineno"> 2031</span>&#160;        }</div>
<div class="line"><a name="l02032"></a><span class="lineno"> 2032</span>&#160;}</div>
<div class="line"><a name="l02033"></a><span class="lineno"> 2033</span>&#160;</div>
<div class="line"><a name="l02034"></a><span class="lineno"> 2034</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l02035"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#a81140313b88b17698b0c48ee6dc3e560"> 2035</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;::FilterIterator::restart</a>(){</div>
<div class="line"><a name="l02036"></a><span class="lineno"> 2036</span>&#160;        start();</div>
<div class="line"><a name="l02037"></a><span class="lineno"> 2037</span>&#160;}</div>
<div class="line"><a name="l02038"></a><span class="lineno"> 2038</span>&#160;</div>
<div class="line"><a name="l02039"></a><span class="lineno"> 2039</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l02040"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#aa19b20129bbb3eb5878c10b94801e344"> 2040</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">void</span> <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;::FilterIterator::restartFrom</a>(<span class="keywordtype">long</span> i){</div>
<div class="line"><a name="l02041"></a><span class="lineno"> 2041</span>&#160;        start();</div>
<div class="line"><a name="l02042"></a><span class="lineno"> 2042</span>&#160;        <span class="keywordflow">if</span>(i &gt;= lims[0]) current = <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a> + 1;</div>
<div class="line"><a name="l02043"></a><span class="lineno"> 2043</span>&#160;        <span class="keywordflow">else</span>{</div>
<div class="line"><a name="l02044"></a><span class="lineno"> 2044</span>&#160;                <span class="keywordflow">while</span>(current &lt; i )next();</div>
<div class="line"><a name="l02045"></a><span class="lineno"> 2045</span>&#160;        }</div>
<div class="line"><a name="l02046"></a><span class="lineno"> 2046</span>&#160;}</div>
<div class="line"><a name="l02047"></a><span class="lineno"> 2047</span>&#160;</div>
<div class="line"><a name="l02048"></a><span class="lineno"> 2048</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l02049"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#accfed7e47b4c21d1bb189d2492930a36"> 2049</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;::FilterIterator::hasNext</a>(){</div>
<div class="line"><a name="l02050"></a><span class="lineno"> 2050</span>&#160;        <span class="keywordflow">return</span> current &lt; <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>;</div>
<div class="line"><a name="l02051"></a><span class="lineno"> 2051</span>&#160;}</div>
<div class="line"><a name="l02052"></a><span class="lineno"> 2052</span>&#160;</div>
<div class="line"><a name="l02053"></a><span class="lineno"> 2053</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l02054"></a><span class="lineno"><a class="code" href="classArrayvEBTree_1_1FilterIterator.html#aa9b8e11902a867e96a84d5700a006f9f"> 2054</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">long</span> <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;::FilterIterator::next</a>(){</div>
<div class="line"><a name="l02055"></a><span class="lineno"> 2055</span>&#160;        <span class="comment">//initialize the variables</span></div>
<div class="line"><a name="l02056"></a><span class="lineno"> 2056</span>&#160;        <span class="keywordtype">long</span> ret = current;</div>
<div class="line"><a name="l02057"></a><span class="lineno"> 2057</span>&#160;</div>
<div class="line"><a name="l02058"></a><span class="lineno"> 2058</span>&#160;        <span class="keywordtype">long</span> h = 0;</div>
<div class="line"><a name="l02059"></a><span class="lineno"> 2059</span>&#160;        <span class="keywordtype">long</span> bit ;</div>
<div class="line"><a name="l02060"></a><span class="lineno"> 2060</span>&#160;        <span class="keywordflow">do</span>{</div>
<div class="line"><a name="l02061"></a><span class="lineno"> 2061</span>&#160;                <span class="keywordflow">if</span>(++slides[h] &gt;= <a class="code" href="classBitTools.html#acf7ff71b956d4be998a44c46ad2aafa2" title="number of bits of a word">word_size</a>){</div>
<div class="line"><a name="l02062"></a><span class="lineno"> 2062</span>&#160;                        slides[h] = 0;</div>
<div class="line"><a name="l02063"></a><span class="lineno"> 2063</span>&#160;                        <span class="keywordflow">if</span>(++idxs[h] &gt;= lims[h]){</div>
<div class="line"><a name="l02064"></a><span class="lineno"> 2064</span>&#160;                                current = <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>+1;</div>
<div class="line"><a name="l02065"></a><span class="lineno"> 2065</span>&#160;                                <span class="keywordflow">return</span> ret;</div>
<div class="line"><a name="l02066"></a><span class="lineno"> 2066</span>&#160;                        }</div>
<div class="line"><a name="l02067"></a><span class="lineno"> 2067</span>&#160;                }</div>
<div class="line"><a name="l02068"></a><span class="lineno"> 2068</span>&#160;                bit = <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">bitLeast</a>(idxs[h], slides[h], h);</div>
<div class="line"><a name="l02069"></a><span class="lineno"> 2069</span>&#160;                <span class="keywordflow">while</span>(bit == -1 &amp;&amp; h &lt; ht - 1 ){</div>
<div class="line"><a name="l02070"></a><span class="lineno"> 2070</span>&#160;                        h++;</div>
<div class="line"><a name="l02071"></a><span class="lineno"> 2071</span>&#160;                        <span class="keywordflow">if</span>(++slides[h] &gt;= <a class="code" href="classBitTools.html#acf7ff71b956d4be998a44c46ad2aafa2" title="number of bits of a word">word_size</a>){</div>
<div class="line"><a name="l02072"></a><span class="lineno"> 2072</span>&#160;                                slides[h] = 0;</div>
<div class="line"><a name="l02073"></a><span class="lineno"> 2073</span>&#160;                                <span class="keywordflow">if</span>(++idxs[h] &gt;= lims[h]){</div>
<div class="line"><a name="l02074"></a><span class="lineno"> 2074</span>&#160;                                        current = <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>+1;</div>
<div class="line"><a name="l02075"></a><span class="lineno"> 2075</span>&#160;                                        <span class="keywordflow">return</span> ret;</div>
<div class="line"><a name="l02076"></a><span class="lineno"> 2076</span>&#160;                                }</div>
<div class="line"><a name="l02077"></a><span class="lineno"> 2077</span>&#160;                        }</div>
<div class="line"><a name="l02078"></a><span class="lineno"> 2078</span>&#160;                        bit = <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">bitLeast</a>(idxs[h], slides[h], h);</div>
<div class="line"><a name="l02079"></a><span class="lineno"> 2079</span>&#160;                }</div>
<div class="line"><a name="l02080"></a><span class="lineno"> 2080</span>&#160;</div>
<div class="line"><a name="l02081"></a><span class="lineno"> 2081</span>&#160;                <span class="keywordflow">while</span>(bit==-1 &amp;&amp; idxs[h]++ &lt; lims[h] - 1){</div>
<div class="line"><a name="l02082"></a><span class="lineno"> 2082</span>&#160;                        bit = <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">bitLeast</a>(idxs[h], slides[h], h);</div>
<div class="line"><a name="l02083"></a><span class="lineno"> 2083</span>&#160;                }</div>
<div class="line"><a name="l02084"></a><span class="lineno"> 2084</span>&#160;                <span class="keywordflow">if</span>(idxs[h] == lims[h]) current = <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a> + 1 ;</div>
<div class="line"><a name="l02085"></a><span class="lineno"> 2085</span>&#160;                <span class="keywordflow">else</span>{</div>
<div class="line"><a name="l02086"></a><span class="lineno"> 2086</span>&#160;                        slides[h] = bit;</div>
<div class="line"><a name="l02087"></a><span class="lineno"> 2087</span>&#160;                        <span class="keywordflow">for</span>(; h &gt; 0; h--) {</div>
<div class="line"><a name="l02088"></a><span class="lineno"> 2088</span>&#160;                                idxs[h-1] = (idxs[h] &lt;&lt; <a class="code" href="classBitTools.html#a0fe1acc3156ee09ecd71da226484f638" title="logarithmic of the size, in bits, of a word">logb</a>) + slides[h];</div>
<div class="line"><a name="l02089"></a><span class="lineno"> 2089</span>&#160;                                <span class="keywordflow">if</span>(idxs[h-1] &gt;= lims[h-1]){</div>
<div class="line"><a name="l02090"></a><span class="lineno"> 2090</span>&#160;                                        current = -1;</div>
<div class="line"><a name="l02091"></a><span class="lineno"> 2091</span>&#160;                                        <span class="keywordflow">return</span> ret;</div>
<div class="line"><a name="l02092"></a><span class="lineno"> 2092</span>&#160;                                }</div>
<div class="line"><a name="l02093"></a><span class="lineno"> 2093</span>&#160;                                slides[h-1] = <a class="code" href="classArrayvEBTree.html#abf5800971072de3a815e5f5f35e387b9">bitLeast</a>(idxs[h-1], 0, h-1);</div>
<div class="line"><a name="l02094"></a><span class="lineno"> 2094</span>&#160;                        }</div>
<div class="line"><a name="l02095"></a><span class="lineno"> 2095</span>&#160;                        current = (idxs[0] &lt;&lt; <a class="code" href="classBitTools.html#a0fe1acc3156ee09ecd71da226484f638" title="logarithmic of the size, in bits, of a word">logb</a>) + slides[0];</div>
<div class="line"><a name="l02096"></a><span class="lineno"> 2096</span>&#160;                }</div>
<div class="line"><a name="l02097"></a><span class="lineno"> 2097</span>&#160;        }<span class="keywordflow">while</span>(filter-&gt;isInCompl(current) &amp;&amp; current &lt; <a class="code" href="classArrayvEBTree.html#aa1608b1b0fb4cd83ec4cefff102adfdf" title="The number of elements present in the universe.">size</a>);</div>
<div class="line"><a name="l02098"></a><span class="lineno"> 2098</span>&#160;        <span class="keywordflow">return</span> ret;</div>
<div class="line"><a name="l02099"></a><span class="lineno"> 2099</span>&#160;}</div>
<div class="line"><a name="l02100"></a><span class="lineno"> 2100</span>&#160;</div>
<div class="line"><a name="l02101"></a><span class="lineno"> 2101</span>&#160;<span class="keyword">template</span>&lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l02102"></a><span class="lineno"><a class="code" href="classArrayvEBTree.html#a60875493f7c59c59a61e7cae2259316a"> 2102</a></span>&#160;<span class="keyword">inline</span> <span class="keywordtype">bool</span> <a class="code" href="classArrayvEBTree.html#a60875493f7c59c59a61e7cae2259316a" title="Verify if the current set represeted by this object is empty.">ArrayvEBTree&lt;T&gt;::isEmpty</a>(){</div>
<div class="line"><a name="l02103"></a><span class="lineno"> 2103</span>&#160;        T* top = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> -1])-&gt;vector;</div>
<div class="line"><a name="l02104"></a><span class="lineno"> 2104</span>&#160;        T* lim = ((<a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree</a>*)<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::levels</a>[<a class="code" href="classMultiLevelDirectlyAddressedSet.html" title="An implementation of DirectlyAddressedSet using a static multilevel bitmap as data structure...">MultiLevelDirectlyAddressedSet&lt;T&gt;::height</a> -1])-&gt;vectorsz + top;</div>
<div class="line"><a name="l02105"></a><span class="lineno"> 2105</span>&#160;        <span class="keywordflow">for</span>(;top &lt; lim; top++){</div>
<div class="line"><a name="l02106"></a><span class="lineno"> 2106</span>&#160;                <span class="keywordflow">if</span>(*top != 0) <span class="keywordflow">return</span> <span class="keyword">false</span>;</div>
<div class="line"><a name="l02107"></a><span class="lineno"> 2107</span>&#160;        }</div>
<div class="line"><a name="l02108"></a><span class="lineno"> 2108</span>&#160;        <span class="keywordflow">return</span> <span class="keyword">true</span>;</div>
<div class="line"><a name="l02109"></a><span class="lineno"> 2109</span>&#160;}</div>
<div class="line"><a name="l02110"></a><span class="lineno"> 2110</span>&#160;</div>
<div class="line"><a name="l02111"></a><span class="lineno"> 2111</span>&#160;<span class="keyword">template</span> &lt;<span class="keyword">typename</span> T&gt;</div>
<div class="line"><a name="l02112"></a><span class="lineno"><a class="code" href="classArrayvEBTreeFactory.html"> 2112</a></span>&#160;<span class="keyword">class </span><a class="code" href="classArrayvEBTreeFactory.html">ArrayvEBTreeFactory</a> : <span class="keyword">public</span> DirectlyAddressedSetFactory&lt;long&gt;{</div>
<div class="line"><a name="l02113"></a><span class="lineno"> 2113</span>&#160;<span class="keyword">public</span>:</div>
<div class="line"><a name="l02114"></a><span class="lineno"> 2114</span>&#160;</div>
<div class="line"><a name="l02115"></a><span class="lineno"><a class="code" href="classArrayvEBTreeFactory.html#afbb1af50059dfeb7388d62aa69c7ab1e"> 2115</a></span>&#160;        <a class="code" href="classDirectlyAddressedSet.html">DirectlyAddressedSet&lt;long&gt;</a>* <a class="code" href="classArrayvEBTreeFactory.html#afbb1af50059dfeb7388d62aa69c7ab1e">newOrderedSet</a>(<span class="keywordtype">long</span> n){</div>
<div class="line"><a name="l02116"></a><span class="lineno"> 2116</span>&#160;                <span class="keywordflow">return</span> (<a class="code" href="classDirectlyAddressedSet.html">DirectlyAddressedSet&lt;long&gt;</a>*) <span class="keyword">new</span> <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>(n);</div>
<div class="line"><a name="l02117"></a><span class="lineno"> 2117</span>&#160;        };</div>
<div class="line"><a name="l02118"></a><span class="lineno"> 2118</span>&#160;</div>
<div class="line"><a name="l02119"></a><span class="lineno"><a class="code" href="classArrayvEBTreeFactory.html#a18e28f77ae422ee79bbc44398ee1774d"> 2119</a></span>&#160;        <a class="code" href="classDirectlyAddressedSet.html">DirectlyAddressedSet&lt;long&gt;</a>* <a class="code" href="classArrayvEBTreeFactory.html#a18e28f77ae422ee79bbc44398ee1774d">newOrderedSet</a>(<span class="keywordtype">long</span> n, <span class="keywordtype">void</span>* handle){</div>
<div class="line"><a name="l02120"></a><span class="lineno"> 2120</span>&#160;                <span class="keywordflow">return</span> (<a class="code" href="classDirectlyAddressedSet.html">DirectlyAddressedSet&lt;long&gt;</a>*)<span class="keyword">new</span> <a class="code" href="classArrayvEBTree.html" title="Implementation of vEBTree using a array of words.">ArrayvEBTree&lt;T&gt;</a>(<span class="keyword">this</span>, n, *(<span class="keywordtype">long</span>*)handle);</div>
<div class="line"><a name="l02121"></a><span class="lineno"> 2121</span>&#160;        };</div>
<div class="line"><a name="l02122"></a><span class="lineno"> 2122</span>&#160;</div>
<div class="line"><a name="l02123"></a><span class="lineno"> 2123</span>&#160;};</div>
<div class="line"><a name="l02124"></a><span class="lineno"> 2124</span>&#160;</div>
<div class="line"><a name="l02125"></a><span class="lineno"> 2125</span>&#160;<span class="preprocessor">#endif </span><span class="comment">/* ARRAYVEBTREE_H_ */</span><span class="preprocessor"></span></div>
</div><!-- fragment --></div><!-- contents -->
<!-- start footer part -->
<hr class="footer"/><address class="footer"><small>
Generated on Sun Nov 11 2012 15:19:41 for Disjoint Stable Set Problems - Formulations by Representatives and Combinatorial Solvers by &#160;<a href="http://www.doxygen.org/index.html">
<img class="footer" src="doxygen.png" alt="doxygen"/>
</a> 1.8.1.1
</small></address>
</body>
</html>
